Plane Detector and Detecting Method

ABSTRACT

A rotation matrix and a translation vector between a basic camera ( 12 ) and a reference camera ( 14 ) are read out from a parameter storage section ( 26 ). At a projection conversion matrix calculating section ( 28 ), a projection conversion matrix capable of overlapping the road plane area included in images picked up by the basic camera ( 12 ) and the reference camera ( 14 ) is calculated by using the rotation matrix and the translation vector.

TECHNICAL FIELD

The present invention relates to a plane detecting apparatus and a plane detecting method for detecting a plane that can be traveled by a mobile object from an image captured by a pair of image capturing means mounted in the mobile object, in order to implement vehicle driver assistance and automatic cruise for an autonomous mobile vehicle, for example.

BACKGROUND ART

Processes for detecting a road plane area that can be traveled or detecting an obstacle that is present in a traveling environment in guiding a mobile object such as an autonomous mobile vehicle or the like are roughly classified into processes using a laser radar, ultrasonic waves, a milliwave radar, etc., and processes using images.

The detecting processes using a laser radar and a milliwave radar are problematic in that the apparatus used are generally expensive and a sufficient spatial resolution cannot be achieved. The detecting processes using ultrasonic waves are problematic in that it is difficult to make measurements in distant ranges and the spatial resolution is low.

The processes using images are grouped into single-eyed processes and double-eyed processes. Heretofore, many of the processes using images employ an image obtained from a single eye, i.e., a single viewpoint. They are assumed to be used in a well-maintained environment such as an expressway or the like, and detect a traveling area by detecting a white line on the road (for example, a separation line or a center line). However, in general roads and parking lots where the presence of white lines or the like is not guaranteed and various road plane colors and patterns are present, it is difficult to stably distinguish between areas that can be traveled and obstacles, only from a density pattern obtained from a single-eyed image.

The double-eyed processes, i.e., processes using a stereo image, make it possible to recognize a traveling environment more stably because they can make use of a three-dimensional structure of the traveling environment in principle. Particularly, since an area that can be traveled can be regarded essentially as a plane in space, there has been proposed a process of calculating a projection transformation matrix between images, transforming one of the images into a two-dimensional projection image according to the projection transformation matrix, overlapping the transformed image onto the other image, and detecting whether the image represents a plane area or not or an obstacle or not, based on the overlapping (see Patent Document 1, Non-patent Document 1).

Patent Document 1: Laid-Open Patent Publication 2000-293693 (Japan); and

Non-patent Document 1: Heung-Yeung Shum, Richard Szeliski, “Panoramic Image Mosaics” Technical report, 1997, MSR-TR-97-23, Microsoft Research.

DISCLOSURE OF THE INVENTION

Patent Document 1 discloses a detecting method in which four or more corresponding feature points are extracted from each image and each parameter of a projection transformation matrix is calculated based on the corresponding points. The method requires a premise that such corresponding points exist in order to obtain a projection transformation matrix. Therefore, since the corresponding points cannot be found in an image having few textures, for example, the projection transformation matrix cannot be calculated.

Non-patent Document 1 discloses a detecting method generally called “density gradient method”. In the method, an image obtained by performing a two-dimensional projection transformation with an estimated projection transformation matrix is compared with another image, and thereby it is judged that their density patterns coincide with each other or not. The projection transformation matrix is determined by repeatedly changing the matrix until the coincidence degree reaches a predetermined (coincidence) range. In this case, variation of a traveling surface (road surface) with respect to a mobile object is not considered in Non-patent Document 1, and it is assumed that a calculated projection transformation matrix is determined to be unique with respect to the mobile object.

However, since the mobile object makes a pitching or rolling motion, the positional relationship between the mobile object and the traveling surface is not constant, in general. Thus, in order to obtain an appropriate projection transformation matrix, the projection transformation matrix needs to be calculated depending on the state of the mobile object with respect to the traveling surface. In this case, the time required for calculation of a desired projection transformation matrix depends on the number of unknown parameters of the projection transformation matrix. Therefore, for example, when the state of the mobile object greatly changes and the calculation time is restricted, if the repetitive calculation of the projection transformation matrix is aborted, the projection transformation matrix cannot be calculated sufficiently accurately.

It is a general object of the present invention to provide a plane detecting apparatus and a plane detecting method which can calculate a projection transformation matrix between images highly accurately in a short time to detect a plane highly accurately.

A main object of the present invention is to provide a plane detecting apparatus and a plane detecting method which can calculate a projection transformation matrix reliably, even if an image has few textures.

Another object of the present invention is to provide a plane detecting apparatus and a plane detecting method which can calculate a plane that can be traveled by a mobile object highly accurately in a short time, thereby allowing mobile-object cruise to be assisted based on the calculated plane information.

With a plane detecting apparatus and a plane detecting method according to the present invention, images of a mutually overlapping area containing a plane are captured using a pair of image capturing means located in a predetermined positional relationship, and then a projection transformation matrix for overlapping a plane contained in the image captured by one image capturing means onto a plane contained in the image captured by the other image capturing means is calculated, by use of a rotation matrix and a translation vector that have been determined in advance. In this case, since using the rotation matrix and the translation vector as fixed parameters reduces the number of unknown parameters of the projection transformation matrix, the projection transformation matrix can be calculated highly accurately in a short time. As with the projection transformation matrix, a normal vector defining the plane and a distance from the image capturing means to the plane are also calculated highly accurately in a short time.

Also, by transforming a plane area determined with the projection transformation matrix by use of plane parameters, it is possible to detect a spatial position of the plane area with respect to the image capturing means and detect an object on the plane whose spatial position has been detected.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a view illustrative of a vehicle to which a plane detecting apparatus and a plane detecting method according to the present invention is applied;

FIG. 2 is a functional block diagram of a processing unit mounted on the vehicle shown in FIG. 1;

FIG. 3 is a flowchart of an overall processing sequence of the processing unit shown in FIG. 1;

FIG. 4 is a diagram illustrative of a two-dimensional projection transformation between a pair of image capturing means;

FIG. 5 is a diagram illustrative of a process of extracting a plane area;

FIG. 6 is a flowchart of a processing sequence of an object extracting process;

FIG. 7 is a diagram showing the manner in which a candidate point is extracted based on a height limitation;

FIG. 8 is a diagram showing the manner in which a voting process is performed;

FIG. 9 is a diagram showing a clustering process performed on a voting plane;

FIG. 10 is a diagram showing a voting plane;

FIG. 11 is a flowchart of a processing sequence for determining world coordinates of each edge point of an object;

FIG. 12 is a diagram showing an edge image of extracted edges;

FIG. 13 is a diagram showing actual image data of the edge image of extracted edges;

FIG. 14 is a diagram showing a corrected edge image with a plane area removed;

FIG. 15 is a diagram showing a reference image with an epipolar line established therein;

FIG. 16 is a diagram showing a relationship between a world coordinate system and a camera coordinate system;

FIG. 17 is a diagram showing a depth image;

FIG. 18 is a flowchart of a processing sequence for calculating a relative velocity of an object;

FIG. 19 is a flowchart of a processing sequence for checking how an object area is overlapped;

FIG. 20 is a diagram showing a process of generating a template based on a cluster;

FIG. 21 is a diagram showing a base image with a template established therein;

FIG. 22 is a flowchart of a processing sequence for calculating a center-of-gravity travel distance;

FIG. 23 is a flowchart of a processing sequence for determining an object identity;

FIG. 24 is a flowchart of a processing sequence for recalculating the position of an identical object;

FIG. 25 is a diagram showing a voting plane in which a relative velocity of an object is recorded;

FIG. 26 is a flowchart of a processing sequence for calculating a relative velocity of an object;

FIG. 27 is a diagram showing a process of establishing an epipolar line;

FIG. 28 is a flowchart showing a process of generating a VPP image;

FIG. 29 is a flowchart showing a process of calculating a VPP image transformation formula;

FIG. 30 is a coordinate diagram showing a relationship between a normal vector, a camera coordinate system, and the optical axis of a base camera;

FIG. 31 is a diagram showing a process of transforming a camera coordinate system base image into an image parallel to a road plane;

FIG. 32 is a diagram showing a rotational transformation of a first transformed image;

FIG. 33 is a diagram showing a VPP transformation of a base image;

FIG. 34 is a diagram showing a VPP transformation of a road plane area;

FIG. 35 is a flowchart of a processing sequence for calculating an own vehicle velocity;

FIG. 36 is a flowchart of a processing sequence of a VPP image matching process;

FIG. 37 is a block diagram showing processing details of the VPP image matching process;

FIG. 38 is a block diagram showing a processing sequence for calculating an absolute velocity of an object; and

FIG. 39 is a diagram showing a voting plane in which an absolute velocity of an object is recorded.

BEST MODE FOR CARRYING OUT THE INVENTION

FIG. 1 shows a vehicle 10 (mobile object) according to an embodiment to which a plane detecting apparatus and a plane detecting method according to the present invention is applied. The vehicle 10 has a windshield on which there are fixedly mounted a base camera 12 and a reference camera 14 in upper left and right regions thereof as a pair of image capturing means for capturing images including a road plane area where the vehicle 10 travels. The base camera 12 and the reference camera 14 are stereo cameras comprising CCD cameras or the like with a common image capturing area set therein. The base camera 12 and the reference camera 14 are connected to a processing unit 16 for processing captured images to detect the road plane area and an object which may possibly become an obstacle. In the description which follows, an image captured by the base camera 12 will be referred to as a base image, and an image captured by the reference camera 14 as a reference image.

FIG. 2 is a functional block diagram of the processing unit 16. The processing unit 16 has an image processor 18 for processing a plurality of base images captured by the base camera 12, an image processor 20 for processing a plurality of reference images captured by the reference camera 14, and an image memory 22 for storing base images and reference images that are captured at given image capturing time intervals.

The processing unit 16 also has a processing controller 24 to which there are connected the image memory 22, a parameter memory 26 (parameter storing means), a projection transformation matrix calculator 28 (projection transformation matrix calculating means, projection transformation matrix estimating means), a plane parameter calculator 30 (plane parameter calculating means, plane parameter estimating means), a plane area extractor 32, an object detector 34, an object relative velocity calculator 36, a virtual projection plane image generator 38 (spatial position calculating means), an own vehicle velocity calculator 40, an object absolute velocity calculator 42, and a display processor 44.

The parameter memory 26 stores, as known parameters, a rotation matrix and a translation vector for transforming the base camera 12 coordinate system into the reference camera 14 coordinate system. Also the parameter memory 26 stores initial value parameters required for processing operation, such as an initial value of a normal vector of a plane and an initial value of a distance from the base camera 12 to the plane, internal parameters of the base camera 12 and reference camera 14 and parameters calculated in previous and present processing cycles or the like. The projection transformation matrix calculator 28 calculates a projection transformation matrix for performing a two-dimensional projection transformation from a road plane area in a reference image into a road plane area in a base image. The plane parameter calculator 30 calculates a normal vector to a road plane and a distance from the optical center of the base camera 12 to a road plane as plane parameters. The plane area extractor 32 extracts a road plane area that can be traveled by the vehicle 10, using a base image and a reference image projectively transformed by a projection transformation matrix. The object detector 34 detects an object that is present in an area outside of a road plane area. The object relative velocity calculator 36 calculates a relative velocity vector of an extracted object with respect to the vehicle 10. The virtual projection plane image generator 38 generates a virtual projection plane (VPP) image representative of an extracted road plane area as projected onto a virtual plane parallel to an actual road plane. The own vehicle velocity calculator 40 calculates an own vehicle velocity vector of the vehicle 10 on a VPP image. The object absolute velocity calculator 42 calculates an absolute velocity vector of an object from a relative velocity vector of the object with respect to the vehicle 10 and an own vehicle velocity vector of the vehicle 10. The display processor 44 displays the above processed results on a display, and announces a warning or the like based on the processed results.

The vehicle 10 to which the plane detecting apparatus and the plane detecting method according to the present invention is applied and the processing unit 16 are basically constructed as described above. An overall processing sequence of the processing unit 16 will be described below based on a flowchart shown in FIG. 3.

First, the base camera 12 and the reference camera 14 captures base images and reference images including a road plane area which is being traveled by the vehicle 10, at given time intervals. After the images are processed by the image processors 18, 20, they are stored as image information in the image memory 22 at each time (step S0).

Then, the projection transformation matrix calculator 28 dynamically calculates a projection transformation matrix for performing a two-dimensional projection transformation from a road plane area in a reference image into a road plane area in a base image, using the initial value parameters stored in the parameter memory 26 (step S1).

The plane area extractor 32 extracts the road plane area from a base image, using the projection transformation matrix calculated in step S1 (step S2).

The plane parameter calculator 30 calculates a normal vector to the road plane and a distance from the optical center of the base camera 12 to the road plane as plane parameters (step S3).

Then, the object detector 34 transforms the road plane area extracted in step S2 onto a road plane, using the plane parameters calculated in step S3, and detects objects which may possibly become obstacles other than the vehicle 10, or alternatively makes a stereo measurement with respect to an area other than the road plane area extracted in step S2, and detects objects (step S4).

The object relative velocity calculator 36 calculates a relative velocity vector of each object with respect to the vehicle 10, from positional changes at each time of the respective extracted objects (step S5).

The virtual projection plane image generator 38 generates a virtual projection plane (VPP) image representative of a road plane area as viewed from above, using the normal vector which indicates the gradient of the road plane calculated in step S3 (step S6).

The own vehicle velocity calculator 40 calculates an own vehicle velocity vector of the vehicle 10 from the position at each time in the VPP image generated in step S6 (step S7).

The object absolute velocity calculator 42 calculates an absolute velocity vector of each object from the relative velocity vector of the object calculated in step S5 and the own vehicle velocity vector of the vehicle 10 calculated in step S7 (step S8).

The display processor 44 displays the road plane area extracted as described above, the objects which may possibly become obstacles, the absolute velocities of the vehicle 10 and the objects, etc. on the display, and, if necessary, announces a warning based on the relative positional and velocity relationships between the vehicle 10 and the objects, for example.

The present embodiment will be described in detail below with respect to each of the steps.

First, the principles of the extraction of a road plane area and the two-dimensional projection transformation used in the present invention will be described below. In the description which follows, homogeneous coordinates will be denoted by reference characters followed by a symbol

in the description, and reference characters capped with a symbol “˜” in the equations and the expressions. Projectively transformed images will be denoted by reference characters followed by a symbol “′” in the description, and reference characters capped with a symbol “˜” in the equations and the expressions.

As shown in FIG. 4, it is well known in the art that when an observational point M1 on a plane Π in space is projected onto a base image I_(b) and a reference image I_(r), homogeneous coordinates

on the base image I_(b) and homogeneous coordinates

on the reference image I_(r) are related to each other by a two-dimensional projection transformation as indicated by the expression (1-1):

{tilde over (m)}_(r)˜H{tilde over (m)}_(b)  (1-1)

(“˜” between the left side and the right side represents equality therebetween while allowing indefiniteness of a constant multiplication)

In the above expression, H represents a 3×3 projection transformation matrix. In FIG. 4, O represents the optical center of the base camera 12, O′ the optical center of the reference camera 14, R a rotation matrix from a base camera coordinate system to a reference camera coordinate system, t a translation vector directed from the optical center of the reference camera 14 to the optical center of the base camera 12 in the reference camera coordinate system, d the distance between the optical center O of the base camera 12 and the plane Π, and n the normal vector to the plane Π.

If an area that can be traveled, such as a road, can be regarded as being essentially a plane in space, then it is possible to obtain an image that agrees with the base image I_(b) with respect to the plane by performing an appropriate projection transformation on the area with respect to the reference image I_(r). On the other hand, an object which is not present on the plane produces a projectively transformed image which does not agree with the base image I_(b), and thus the area of the object can be judged not as an area that can be traveled, or can be judged as an area which could become an obstacle. Therefore, an area that can be traveled or an area which can be an obstacle can be detected by calculating the expansiveness of the plane.

<Step S0>

Image information of the base image I_(b) and the reference image I_(r) is acquired.

Images are captured using the base camera 12 and the reference camera 14. In order to remove the brightness difference between the images, the images are subjected to LOG (Laplacian of Gaussian) filters by the image processors 18, 20. Since the images processed by the LOG filters have a low contrast level, they are subjected to histogram equalization. The base image I_(b) and the reference image I_(r) thus processed and their original images are stored in the image memory 22.

<Step S1>

The projection transformation matrix calculator 28 dynamically calculates a projection transformation matrix H with respect to a road plane, using the base image I_(b) and the reference image I_(r) that are stored in the image memory 22.

Specifically, within a certain area R¹ in the base image I_(b), the projection transformation matrix H is changed slightly, and a projection transformation matrix H for minimizing an evaluation function E(H) according to the expression (1-2) below is estimated by repetitive optimization.

$\begin{matrix} {{E(H)} = {\sum\limits_{m_{b} \in R^{l}}\left\lbrack {{I_{r}\left( {H\; {\overset{\sim}{m}}_{b}} \right)} - {I_{b}\left( {\overset{\sim}{m}}_{b} \right)}} \right\rbrack^{2}}} & \left( {1\text{-}2} \right) \end{matrix}$

where I_(b)(

), I_(r)(

) represent respective luminance values of the base image I_(b) and the reference image I_(r) at the homogeneous coordinates

The above estimation requires the projection transformation matrix H as an initial value that is appropriately close to a true value and an area R¹ (according to the present invention, hereinafter called “calculation area”). The projection transformation matrix H and the calculation area R¹ are then determined according to a process described below, using time-series information.

A projection transformation matrix H_(s) between a base image I_(b) and a reference image I_(r) at the same time, a projection transformation matrix H_(m) between two base images I_(b) acquired at successive times, and a calculation area R¹ with respect to a base image I_(b) are determined. For estimating a projection transformation matrix H (H_(s), H_(m)) at a certain time t, estimated results up to a preceding time (t−1) are employed.

First, a projection transformation matrix H_(m)(t) between successive base images I_(b)(t−1) and I_(b)(t), is estimated by repetitive optimization based on the expression (1-2). At this time, a projection transformation matrix H_(m)(t−1) estimated at the preceding time may be used as an initial value of the projection transformation matrix H_(m)(t), and a calculation area R¹(t−1) determined at the preceding time with respect to a base image I_(b)(t−1) may be used as an initial value of the calculation area R¹.

Then, using the determined projection transformation matrix H_(m)(t), the calculation area R¹(t−1) at the preceding time is transformed to determine a predicted value of a calculation area R¹(t) at the present time.

A projection transformation matrix H_(s)(t) between a base image I_(b) and a reference image I_(r) is estimated by repetitive optimization based on the expression (1-2), using the projection transformation matrix H_(s)(t−1) estimated at the preceding time as an initial value and also using the calculation area R¹(t) determined from the projection transformation matrix H_(m)(t).

In the successive estimation using time-series images, a dynamic projection transformation matrix H_(s) (hereinafter referred to as a projection transformation matrix H) between a base image I_(b) and a reference image I_(r) at the time t can stably be estimated using the projection transformation matrix H as an initial value that is appropriately close to a true value and the calculation area R¹.

A process of estimating the projection transformation matrix H according to repetitive optimization (density gradient method) using the expression (1-2) will be described in detail below.

The density gradient method is a method of estimating a change in the projection transformation matrix H for maximum image overlapping by changing one of two images slightly and minimizing an evaluation function representing how the images are overlapped (density difference).

If a luminance value of a reference image I_(r) at coordinates x (x, y) is represented by I_(r)(x), then a reference image I_(r), projectively transformed by an appropriate projection transformation matrix H is expressed by the expression (1-3) shown below. The symbol “˜” above the reference image I_(r) indicates an image that has been projectively transformed, and the symbol “˜” above x indicates homogeneous coordinates of the coordinates x (x, Y).

Ĩ _(r)({tilde over (x)})=I _(r)(H{tilde over (x)})  (1-3)

The projection transformation matrix H is a matrix with eight degrees of freedom (one parameter being fixed) made up of 3×3 parameters.

If, when the 8 parameters of the projection transformation matrix H are changed slightly, the coordinates x (x, y) on the reference image I_(r)′ that has been projectively transformed change to coordinates x″ (x″, y″), then the relationship expressed by:

{tilde over (x)}″˜(I+D_(x)){tilde over (x)}  (1-4)

(“˜” represents equality therebetween while allowing indefiniteness of constant multiplication) is obtained. In the above expression, I represents a 3×3 unit matrix, and D_(x) a 3×3 slightly changed matrix having, as parameters thereof, slight changes in the parameters of the projection transformation matrix H.

Using the relationships represented by the expressions (1-3), (1-4), the evaluation function E(H) according to the expression (1-2), which represents an overlapped state of the projectively transformed reference image I_(r)′ and the base image I_(b) is expressed, using as variables, the parameters of the slightly changed matrix D_(x) of the projection transformation matrix H, as follows:

$\begin{matrix} {{E\left( d_{x} \right)} = {\sum\limits_{i}\left\lbrack {{{\overset{\sim}{I}}_{r}\left( {\overset{\sim}{x}}_{i}^{''} \right)} - {I_{b}\left( {\overset{\sim}{x}}_{i} \right)}} \right\rbrack^{2}}} & \left( {1\text{-}5} \right) \end{matrix}$

(“i” represents a pixel number) In the above expression, d_(x) represents a parameter of the slightly changed matrix D_(x) as expressed in terms of a vector.

When the expression (1-5) is Taylor expanded for first-order approximation, it is expressed as follows:

$\begin{matrix} {\begin{matrix} {{E\left( d_{x} \right)} \approx {\sum\limits_{i}\left\lbrack {{{\overset{\sim}{I}}_{r}\left( {\overset{\sim}{x}}_{i} \right)} + {{\nabla{{\overset{\sim}{I}}_{r}\left( {\overset{\sim}{x}}_{i} \right)}}\frac{\partial{\overset{\sim}{x}}_{i}^{''}}{\partial d_{x}}d_{x}} - {I_{b}\left( {\overset{\sim}{x}}_{i} \right)}} \right\rbrack^{2}}} \\ {= {\sum\limits_{i}\left\lbrack {{g_{i}^{t}J_{{dx}_{i}}^{t}d_{x}} + e_{i}} \right\rbrack^{2}}} \end{matrix}{{{where}\mspace{14mu} g_{i}} = {{{\nabla{{\overset{\sim}{I}}_{r}\left( {\overset{\sim}{x}}_{i} \right)}}\mspace{14mu} e_{i}} = {{{\overset{\sim}{I}}_{r}\left( {\overset{\sim}{x}}_{i} \right)} - {I_{b}\left( {\overset{\sim}{x}}_{i} \right)}}}}{J_{{dx}_{i}} = {{J_{{dx}_{i}}^{t}\left( {\overset{\sim}{x}}_{i} \right)} = \frac{\partial{\overset{\sim}{x}}_{i}^{''}}{\partial d_{x}}}}} & \left( {1\text{-}6} \right) \end{matrix}$

(“≈” represents equality therebetween within the range of first-order approximation according to the expression (1-5))

The vector d_(x) for minimizing the evaluation function E(d_(x)) according to the expression (1-6) can be determined by differentiating the evaluation function E(d_(x)) with respect to the vector d_(x), setting the differential value to 0, and solving the following equation:

$\begin{matrix} {{{Ad}_{x} = {- b}}{where}{A = {\sum\limits_{i}{J_{{dx}_{i}}g_{i}g_{i}^{t}J_{{dx}_{i}}^{t}}}}{B = {\sum\limits_{i}{e_{i}J_{{dx}_{i}}g_{i}}}}} & \left( {1\text{-}7} \right) \end{matrix}$

In this case, g_(i) (luminance gradient) and e_(i) (luminance difference) are calculated from the base image I_(b) and the projectively transformed reference image I_(r)′, and the Jacobian J_(dxi) is calculated from the coordinates x (x, y). Therefore, the vector d_(x) is determined according to the equation (1-7) based on the least-squares method.

Using the vector d_(x) thus determined, i.e., the slightly changed matrix D_(x), the projection transformation matrix H is updated according to the expression (1-8) shown below. In the expression (1-8), I represents a 3×3 unit matrix.

H←H(I+D _(x))  (1-8)

Using the projection transformation matrix H determined according to the expression (1-8), the value of the evaluation function E(d_(x)) according to the expression (1-6) is repeatedly calculated again. A projection transformation matrix H calculated when the value of the evaluation function E(d_(x)) converges to a predetermined value or less is used as a desired projection transformation matrix H.

In the above explanation, the projection transformation matrix H is estimated assuming that eight parameters of the projection transformation matrix H are unknown. If the rotation matrix R and the translation vector t between the base camera 12 and the reference camera 14 are fixed with respect to the vehicle 10, then a dynamic projection transformation matrix H can quickly and highly accurately be estimated by changing plane parameters (normal vector n and distance d) using the rotation matrix R and the translation vector t that have been determined in advance.

In this case, after the base camera 12 and the reference camera 14 have been fixed to the vehicle 10, the rotation matrix R and the translation vector t can be determined in an ideal environment such as a maintenance factory where the vehicle 10 is held at rest. When the projection transformation matrix H is determined at a desired time while the vehicle 10 is traveling, the rotation matrix R and the translation vector t that have been highly accurately determined in the ideal environment are employed. Therefore, the projection transformation matrix H can be calculated highly accurately.

First, a method of calculating the rotation matrix R and the translation vector t will be explained. Rather than calculating the rotation matrix R and the translation vector t as described below, the rotation matrix R and the translation vector t may be determined according to another calibration method or may be determined by directly measuring the positional relationship between the base camera 12 and the reference camera 14.

While the vehicle 10 is being held at rest, the plane n is imaged by the base camera 12 and the reference camera 14, and thereafter the projection transformation matrix H is estimated using an evaluation function E(d_(x)) according to the expression (1-5).

Using the rotation matrix R from the base camera coordinate system to the reference camera coordinate system, the translation vector t directed from the optical center of the reference camera 14 to the optical center of the base camera 12, and internal parameters A_(b), A_(r) of the base camera 12 and the reference camera 14, the projection transformation matrix H is expressed as:

$\begin{matrix} {H = {{A_{r} \cdot {k\left( {R + \frac{{tn}^{t}}{d}} \right)}}A_{b}^{- 1}}} & \left( {1\text{-}9} \right) \end{matrix}$

In the above expression, k is a coefficient which is not 0, and indicates that the projection transformation matrix H obtained from the image has degrees of freedom which are represented by a constant multiplication. If the internal parameters A_(b), A_(r) are known, then the following expression (1-10) is satisfied:

$\begin{matrix} {H^{\prime} = {{A_{r}^{- 1}{HA}_{b}} = {k\left( {R + \frac{{tn}^{t}}{d}} \right)}}} & \left( {1\text{-}10} \right) \end{matrix}$

The projection transformation matrix H′ is singular-value decomposed. If it is assumed that U, V represent orthonormal matrixes and Σ a diagonal matrix having singular values σ₁ through σ₃ (σ₁±σ₂≧θ₃>0) of the projection transformation matrix H′ as elements, the projection transformation matrix H′ can be written as:

H′=UΣV^(t)  (1-11)

The diagonal matrix Σ is given as follows:

$\begin{matrix} {\Sigma = \begin{pmatrix} \sigma_{1} & 0 & 0 \\ 0 & \sigma_{2} & 0 \\ 0 & 0 & \sigma_{3} \end{pmatrix}} & \left( {1\text{-}12} \right) \end{matrix}$

From the expressions (1-10), (1-11), the diagonal matrix Σ is expressed as follows:

$\begin{matrix} {\Sigma = {{U^{t}H^{\prime}V} = {{k\left( {{U^{t}{RV}} + {U^{t}\frac{{tn}^{t}}{d}V}} \right)}{If}}}} & \left( {1\text{-}13} \right) \\ {{{U^{t}{RV}} = R^{\prime}},{{U^{t}t} = t^{\prime}},{{n^{t}V} = n^{\prime \; t}}} & \left( {1\text{-}14} \right) \end{matrix}$

then the following expression (1-15) is obtained:

$\begin{matrix} {\Sigma = {k\left( {R^{\prime} + \frac{t^{\prime}n^{\prime \; t}}{d}} \right)}} & \left( {1\text{-}15} \right) \end{matrix}$

Introducing a base vector (e₁, e₂, e₃) of the base camera coordinate system to produce the following expression:

n′=n ₁ ′e ₁ +n ₂ ′e ₂ +n ₃ ′e ₃  (1-16)

based on three vector equations obtained from the expression (1-15), and since n, n′ represent unit vectors, V an orthonormal vector, and R′ a rotational matrix free of a norm change, the following equation (1-17) is obtained:

(k ²−σ_(j) ²)n′ _(i) ²+(k ²−σ_(i) ²)n′ _(j) ²=0 (i≠j)  (1-17)

If the equation (1-17) is considered to be simultaneous equations of n₁′², n₂′², n₃′², then in order to have solutions which are not 0, since the matrix is 0, the equation (1-17) becomes:

(k ²−σ₁ ²)(k ₂−σ₂ ²)(k ²−σ₃ ²)=0  (1-18)

Different cases wherein the singular values σ₁ through σ₃ of the projection transformation matrix H′:

(I) do not have multiple roots (σ₁≠σ₂≠σ₃),

(II) have multiple roots (σ₁=σ₂≠σ₃ or σ₁≠σ₂=σ₃),

and

(III) have three multiple roots (σ₁=σ₂=σ₃)

will be considered below. In the cases (I), (II), if k=±σ₁ or k=±σ₃, then it is contradictory to the fact that n′ calculated according to the equation (3-9) is a unit vector. Therefore, in any case, it is determined that k=±σ₂. The case where k=−ν₂ is excluded because the two cameras (the base camera 12 and the reference camera 14) are positioned so as to sandwich a plane therebetween, and k is determined as σ₂. The case (III) where three multiple roots are obtained is excluded because the optical centers of the base camera 12 and the reference camera 14 coincide with each other and only rotation is involved.

In the cases (I), (II), n′ is determined according to the equation (1-17) as:

$\begin{matrix} {n^{\prime} = {\begin{pmatrix} n_{1}^{\prime} \\ n_{2}^{\prime} \\ n_{3}^{\prime} \end{pmatrix} = {\begin{pmatrix} {ɛ_{1}\sqrt{\frac{\sigma_{1}^{2} - \sigma_{2}^{2}}{\sigma_{1}^{2} - \sigma_{3}^{2}}}} \\ {ɛ_{2}\sqrt{\frac{\sigma_{2}^{2} - \sigma_{3}^{2}}{\sigma_{1}^{2} - \sigma_{3}^{2}}}} \end{pmatrix}\left( {ɛ_{1},{ɛ_{2} = {\pm 1}}} \right)}}} & \left( {1\text{-}19} \right) \end{matrix}$

When σ₁≠σ₂≠σ₃, since n₂′=0, the following expression is obtained:

R′e₂=e₂  (1-20)

R′ represents a rotation matrix around e₂. Therefore, the following expressions (1-21), (1-22), (1-23) are obtained:

$\begin{matrix} {R^{\prime} = \begin{pmatrix} {\cos (\theta)} & 0 & {- {\sin (\theta)}} \\ 0 & 1 & 0 \\ {\sin (\theta)} & 0 & {\cos (\theta)} \end{pmatrix}} & \left( {1\text{-}21} \right) \\ \left\{ \begin{matrix} {{\sin (\theta)} = {{\frac{s_{1} - s_{3}}{s_{2}}n_{1}^{\prime}n_{3}^{\prime}} = {ɛ_{1}ɛ_{2}\sqrt{\frac{\left( {\sigma_{1}^{2} - \sigma_{2}^{2}} \right)\left( {\sigma_{2}^{2} - \sigma_{3}^{2}} \right)}{\left( {\sigma_{1} + \sigma_{3}} \right)\sigma_{2}}}}}} \\ {{\cos (\theta)} = {\frac{{s_{1}n_{3}^{\prime \; 2}} + {s_{3}n_{1}^{\prime \; 2}}}{s_{2}} = \frac{\sigma_{2}^{2} + {\sigma_{1}\sigma_{3}}}{\left( {\sigma_{1} + \sigma_{3}} \right)\sigma_{2}}}} \end{matrix} \right. & \left( {1\text{-}22} \right) \\ {\frac{t^{\prime}}{d} = {\frac{\sigma_{1} - \sigma_{3}}{\sigma_{2}}\begin{pmatrix} n_{1}^{\prime} \\ 0 \\ {- n_{3}^{\prime}} \end{pmatrix}}} & \left( {1\text{-}23} \right) \end{matrix}$

In the case (II), σ₁=σ₂ (or σ₂=σ₃), and from the expression (1-21),

$\begin{matrix} {{n_{1}^{\prime} = {n_{2}^{\prime} = 0}},{n_{3}^{\prime} = {{\pm 1}\mspace{14mu} \left( {{n_{1}^{\prime} = {\pm 1}},{n_{2}^{\prime} = {n_{3}^{\prime} = 0}}} \right)}}} & \left( {1\text{-}24} \right) \\ {{R^{\prime} = I}{and}} & \left( {1\text{-}25} \right) \\ {\frac{t^{\prime}}{d} = {\frac{\sigma_{3} - \sigma_{1}}{\sigma_{2}}n^{\prime}}} & \left( {1\text{-}26} \right) \end{matrix}$

Because of the different signs of ε₁, ε₂ in the expression (1-19), there are four solution candidates. Of the four candidates, n′ which satisfies the condition that a point on the plane appears in the image is selected, narrowing them down to two candidates. Furthermore, the condition that the positional relationship between the base camera 12 and the reference camera 14 does not change during the image capturing process is added, thereby determining a unique solution.

By thus substituting R′ determined according to the expression (1-21) into the expressions (1-14), a rotation matrix R is determined. Then, t/d is determined by substituting t′ determined according to the expression (1-23) or the expression (1-26) into the expression (1-14), and normalized to determine a unit vector t_(e) of a translation vector t as:

$\begin{matrix} {t_{e} = {\frac{1}{\frac{t}{d}} \cdot \frac{t}{d}}} & \left( {1\text{-}27} \right) \end{matrix}$

Inasmuch as the length |t| (the distance between the base camera 12 and the reference camera 14) of the translation vector t can be determined in advance from a design value or a measured value, the translation vector t can be determined by multiplying the unit vector t_(e) according to the expression (1-27) by |t|. The rotation matrix R and the translation vector t thus calculated are stored in the parameter memory 26.

Then, the rotation matrix R and the translation vector t thus calculated are read out from the parameter memory 26, and at a desired time a dynamic projection transformation matrix H is calculated.

The expression (1-9) can be rewritten to expand the projection transformation matrix H as follows:

$\begin{matrix} {H = {{A_{r}{RA}_{b}^{- 1}} + {A_{r}t\; \frac{n^{t}}{d}A_{b}^{- 1}}}} & \left( {1\text{-}28} \right) \end{matrix}$

As the projection transformation matrix H is calculated from its constituent parameters, the coefficient k indicative of the indefiniteness of a constant multiplication may be set to 1. In this case, the first term of the projection transformation matrix H is a constant as the translation vector t is known, and the second term thereof is a variable of n/d. Therefore, the projection transformation matrix H can be determined by estimating the second term.

If a slightly changed matrix of the projection transformation matrix H at the time when n/d is slightly changed is represented by D, then the slightly changed matrix D is expressed by:

$\begin{matrix} {{D = {A_{r}t\; \delta \; n^{''\; t}A_{b}^{- 1}}}{where}{{\delta \; n^{''}} = {\delta \left( \frac{n}{d} \right)}}} & \left( {1\text{-}29} \right) \end{matrix}$

n″=n/d, and its slightly changed quantity is represented by δn″.

The slightly changed matrix D is rewritten into the slightly changed quantity δn″ of n/d, and an evaluation function E(δn″) corresponding to the expression (1-5) is Taylor expanded for first-order approximation, it is expressed as follows:

$\begin{matrix} {\begin{matrix} {{E\left( {\delta \; n^{''}} \right)} \approx {\sum\limits_{i}\left\lbrack {{{\overset{\sim}{I}}_{r}\left( {\overset{\sim}{x}}_{i} \right)} + {{\nabla{{\overset{\sim}{I}}_{r}\left( {\overset{\sim}{x}}_{i} \right)}}\frac{\partial{\overset{\sim}{x}}_{i}^{''}}{\partial d_{xi}}\frac{\partial d_{xi}}{{\partial\delta}\; n^{''}}\delta \; n^{''}} - {{\overset{\sim}{I}}_{b}\left( {\overset{\sim}{x}}_{i} \right)}} \right\rbrack^{2}}} \\ {= {\sum\limits_{i}\left\lbrack {{g_{i}^{t}J_{dxi}^{t}J_{\delta \; n^{''}}\delta \; n^{''}} + e_{i}} \right\rbrack^{2}}} \end{matrix}{where}{{d_{xi} = {\frac{\partial d_{xi}}{{\partial\delta}\; n^{''}}\delta \; n^{''}}},{J_{{dn}^{''}} = {{J_{{dn}^{''}}\left( d_{xi} \right)} = \frac{\partial d_{xi}}{{\partial\delta}\; n^{''}}}}}} & \left( {1\text{-}30} \right) \end{matrix}$

(“≈” represents equality therebetween within the range of first-order approximation according to the expression (1-5))

The slightly changed quantity δn″ for minimizing the evaluation function E(δn″) according to the expression (1-30) can be determined by differentiating the evaluation function E(δn″) with respect to the slightly changed quantity δn″ and setting the differential value to 0, and solving the following equation:

$\begin{matrix} {{{A_{d}n^{''}} = {- b}}{where}{A = {\sum\limits_{i}{J_{{dn}^{''}}^{t}J_{dxi}g_{i}g_{i}^{t}J_{dxi}^{t}J_{{dn}^{''}}}}}{b = {\sum\limits_{i}{e_{i}J_{{dn}^{''}}^{t}J_{dxi}^{t}g_{i}}}}} & \left( {1\text{-}31} \right) \end{matrix}$

In this case, g_(i) (luminance gradient) and e_(i) (luminance difference) are calculated from the base image I_(b) and the protectively transformed reference image I_(r), and the Jacobian J_(dxi) is calculated from the coordinates x (x, y). The Jacobian J_(δn″) is calculated from internal parameters A_(b), A_(r) of the base camera 12 and the reference camera 14, and the translation vector t. Therefore, the slightly changed quantity δn″ is determined according to the equation (1-31) using the least-squares method.

From the slightly changed quantity δn″ thus determined, the slightly changed matrix D of the projection transformation matrix H is determined according to the expression (1-29), and the projection transformation matrix H is updated according to the expression (1-32) shown below.

H←H+D  (1-32)

The slightly changed quantity δn″ is added to n″ (=n/d) determined in the preceding processing cycle, and updated according to the expression (1-33) shown below.

n″←n″+δn″  (1-33)

Using the projection transformation matrix H determined according to the expression (1-32) and n″ determined according to the expression (1-33), the value of the evaluation function E(δn″) according to the expression (1-30) is repeatedly calculated again. A projection transformation matrix H calculated when the value of the evaluation function E(δn″) converges to a predetermined value or less is used as a desired projection transformation matrix H.

As described above, using the rotation matrix R and the translation vector t determined in advance, freedom of parameters of the projection transformation matrix H is only three parameters of the n/d, and thus the projection transformation matrix H can be estimated quickly and highly accurately.

<Step S2>

The plane area extractor 32 extracts a road plane area that can be traveled by the vehicle 10, using the projection transformation matrix H estimated in step S1. The extracting process will be described below with reference to FIG. 5.

The projection transformation matrix H estimated in step S1 acts on the reference image I_(r) that has been LOG-filtered and histogram-equalized in step S0, generating a projectively transformed image I_(r)′.

Then, a differential image (I_(r)′−I_(b)) between the base image I_(b) that has been LOG-filtered and histogram-equalized in step S0 and the generated projectively transformed image I_(r)′ is determined.

Since a point that is present on the plane is accurately projected onto the base image I_(b), the luminance value of the differential image (I_(r)′−I_(b)) is small. On the other hand, the luminance value of a differential image (I_(r)′−I_(b)) of a point that is not present on the plane is large. Therefore, a road plane area Π_(f) can be extracted by establishing a certain threshold value and binarizing the differential image (I_(r)′−I_(b)) using the established threshold value.

<Step S3>

The plane parameter calculator 30 calculates plane parameters of the plane Π, using the projection transformation matrix H estimated in step S1. In this case, from n″ according to the expression (1-33) updated at the time the projection transformation matrix H converges, a normal vector n and a distance d which serve as plane parameters are quickly determined as follows:

$\begin{matrix} {n = \frac{n^{''}}{n^{''}}} & \left( {3\text{-}1} \right) \\ {d = \frac{1}{n^{''}}} & \left( {3\text{-}2} \right) \end{matrix}$

As described above, using the rotation matrix R and the translation vector t thus determined in advance, a projection transformation matrix H can be estimated quickly and highly accurately, and a normal vector n and a distance d can simultaneously be calculated.

<Step S4>

Step S4 is a process of detecting an object, and comprises a subroutine of steps S41 through S46 shown in FIG. 6.

In step S41, the base camera 12 and the reference camera 14 make a stereo measurement of a three-dimensional area to determine world coordinates Cw of each edge point of an object.

In step S42, based on a height coordinate Yw (see FIG. 7) of the world coordinates Cw, a candidate point on the object is extracted according to the height from the plane. Specifically, as shown in FIG. 7, candidate points (Tmin≦Yw<Tmax) that are present in a space whose height from the plane is equal to or greater than Tmin (e.g., 20 cm) and smaller than Tmax (e.g., 2.5 m) are extracted. Consequently, at least portions of a crossover bridge, a tunnel entrance, a billboard, etc. on the road are excluded, and only portions involved in the travel of the vehicle 10, such as other vehicles, guardrails, etc. are extracted more easily. Thus, a candidate point Pa shown in FIG. 7 is extracted, and a candidate point Pb shown in FIG. 7 is excluded.

Candidate points limited to predetermined ranges in an Xw direction which is the transverse direction of the vehicle and a Zw direction which is the longitudinal direction of the vehicle may also be extracted. Accordingly, an unnecessary voting process is prevented from being carried out for areas where there is no possibility for the vehicle 10 to pass through, resulting in a reduction in the amount of calculations. As shown in FIG. 8, the range in an x direction may be limited to −10 through 10 m and the range in a z direction may be limited to 0 through 40 m.

In step S43, the candidate points on the object are projected onto blocks (cells) of a uniform size on a voting plane 50 shown in FIG. 8, depending on their Xw, Zw coordinates. The voting plane 50 is represented as a coordinate plane of coordinate axes Xw, Zw (see FIG. 16) which are two orthogonal axes of a world coordinate system. If a plurality of candidate points are overlappingly projected onto a cell of the same object, then the overlap count is recorded. A process of projecting candidate points while taking into account the overlap count is referred to as voting, and the overlap count as a vote count. According to the voting process, since points smaller than Tmin and points equal to and greater than Tmax have been excluded in step S42, the vote counts for points corresponding to a crossover bridge, a tunnel entrance, a billboard, etc. is 0 or a sufficiently small value. The voting plane 50 in FIGS. 8 and 9 is shown by way of illustrative example only, and has no bearing on FIG. 5, etc.

In step S44, a clustering process is performed to group candidate points voted onto the voting plane 50, into adjacent groups. The groups produced by the clustering process are referred to as clusters. The clustering process may be a nearest neighbor method, and features used in the nearest neighbor method may include a width (coordinate Xw) and a depth (coordinate Zw). According to the clustering process, no model is required for an object to be detected, and objects of various shapes can be detected.

As shown in FIG. 9, three clusters 52 a, 52 b, 52 c, for example, are obtained on the voting plane 50 according to the clustering process in step S44.

For the purpose of removing noise due to a correspondence search error (matching error) in the stereo measurement, the clusters produced by the clustering process may be processed by a dilation/erosion process. If a matching error occurs when an object is stereographically measured, then measured three-dimensional positions suffer an error, and the measured object shape has surface irregularities (noise), which tend to change the cluster shapes. According to the dilation/erosion process, the surface irregularities are joined when the clusters are dilated, and then returned to their original sizes when they are eroded. Therefore, the clusters are processed into shapes less susceptible to noise.

In step S45, it is determined whether the clusters 52 a, 52 b, 52 c grouped by the clustering process represent an object or noise, and then clusters representative of noise are removed.

Specifically, the total vote count of each of the clusters 52 a, 52 b, 52 c is determined. The total vote count of the cluster 52 a is 38, the total vote count of the cluster 52 b is 21, and the total vote count of the cluster 52 c is 3. Then, a threshold value Thz based on the values Zg of coordinates Zw which represent depths of centers g of gravity on respective areas of the clusters 52 a, 52 b, 52 c is compared with each of the total vote counts. Those clusters whose total vote counts are equal to or smaller than the threshold value Thz are removed as noise. The threshold value Thz is expressed by the following expression (4-1):

Thz=Kg×(1/Zg)²  (4-1)

Where Kg is a coefficient which may be, for example, a minimum total vote count in the case where there exists an object 1 m ahead. The expression (4-1) is established based on the phenomenon that the area of an object in an image is smaller in inverse proportion to the square of the distance.

According to the processing of step S45, the cluster 52 c with the small total vote count is removed as noise. Objects with small total vote counts, such as a crossover bridge, a tunnel entrance, a billboard, etc., are also removed as noise.

A voting plane from which noise has been removed is shown in FIG. 10 as representing nearly actual data in view of the example shown in FIG. 5. The voting plane 50 is recorded in a given memory. In the voting plane 50, there are extracted a cluster 54 a corresponding to a truck that is changing lanes in a relatively close forward position, a cluster 54 b corresponding to a passenger car traveling ahead of the truck, and a cluster 54 c corresponding to a guardrail. The coordinate axis Xw, the coordinate axis Zw, and the vehicle 10 which is the own vehicle are also schematically shown in the voting plane 50 for confirmation by the designer.

In step S46, the remaining clusters 54 a, 54 b, 54 c are recognized as objects, and corresponding object position areas are clipped and stored in the memory.

The object extracting process in step S4 (see FIG. 3) is made up of these steps S41 through S46. Each of these steps will be described in greater detail below.

Step S41 comprises a subroutine of steps S411 through S417 shown in FIG. 11.

In step S411, a Sobel filtering process is performed for extracting edges and feature points from the base image. I_(b). The Sobel filtering process is a filtering process for extracting image edges by multiplying pixels adjacent to each pixel by given coefficients and totaling the multiplied results. The Sobel filtering process is carried out using two coefficient matrixes in vertical and horizontal directions.

Specifically, the light reflected from an object whose surface causes specular reflection, such as an automobile, changes depending on the angle at which the reflected light is viewed. A point on the object which is observed in left and right images exhibits different luminance values. Therefore, an area base matching process may not be done well between the left and right images, tending to result in inaccurate stereo distance measurement. To avoid such a drawback, a stereo matching process is not performed on textureless portions and portions causing specular reflection, but on edges only for distance measurement. First, the Sobel filtering process is performed on an input image to extract edges and feature points, and thereafter the extracted data are binarized to generate an edge image 60 shown in FIG. 12. At this time, as shown in FIG. 12, portions, such as a white line on the road, which are not related to the detection of an object are also extracted in the edge image 60.

In FIG. 12, the edge image 60 is schematically shown for illustrative purpose. Actually, image data shown in FIG. 13 are generated as data of the edge image 60.

In step S412, since edges on the road plane such as the white line are not to be detected, a plane area Π_(f) (see FIG. 5) obtained in the road plane area extracting process (step S2) is removed from the edge image 60. Specifically, the binary data of the edge image 60 and the plane area Π_(f) are exclusively-operated to produce a corrected edge image 62 shown in FIG. 14. An upper area having a certain width in the edge image 60 and an area on a lower engine hood in the edge image 60 are not to be detected. Since these areas are fixed in position in the edge image 60, these areas are also removed by a given area specifying means.

Even if plane portions are not fully removed from the edge image 60, they will not be detected in error since a process limited to the space where the vehicle 10 passes through is carried out as described later.

In step S413, an epipolar line EP (see FIG. 15) is established as a search range on the reference image I_(r) which corresponds to edge points remaining on the corrected edge image 62. The epipolar line EP is calculated as a straight line including points corresponding to the reference image I_(r) of the edge points on the corrected edge image 62, based on the internal parameter of the reference camera 14, the internal parameter of the base camera 12, and the rotation matrix R and the translation vector t between the reference camera 14 and the base camera 12. Details of the epipolar line EP will be described later.

In step S414, the plane area Π_(f) obtained in the road plane area extracting process (step S2) is multiplied by an inverse matrix of the projection transformation matrix to determine a reference plane area Π_(fr) on the reference image I_(r), and the reference plane area Π_(fr) is projected onto the reference image I_(r).

In step S415, the reference plane area Π_(fr) is removed from the epipolar line EP on the reference image I_(r), limiting the epipolar line EP to a non-plane area.

In step S416, an area base matching process is performed on the epipolar line EP on the reference image I_(r) with respect to a small area on the base image I_(b) which corresponds to edge points. The area base matching process is a process of generating a small matching window around the edge points in the base image I_(b) and successively calculating similarities between the matching window and the small window on the epipolar line EP on the reference image I_(r). According to the area base matching process, points whose similarity is the highest are determined as points (window) corresponding to the edge points.

At this time, the area base matching process is performed from the base image I_(b) to the reference image I_(r), and calculated similarities are compared with a threshold value. If matching is judged as being successful, then the area base matching process is performed from the reference image I_(r) to the base image I_(b). If points match the points in the preceding base image I_(b), then matching is judged as being established. When the area base matching process is performed in this manner, a matching error due to repetitive patterns is avoided. The threshold value used may include a first threshold value for a maximum value of similarity and a second threshold value based on the difference between the maximum value of similarity and a second greatest value of similarity.

The similarities may be calculated using a zero-mean normalized cross-correlation function (ZNCC) as a similarity function. Since pattern similarities are calculated by the zero-mean normalized cross-correlation function, a matching error is less likely to occur even if an overall luminance offset is present between the base image I_(b) and the reference image I_(r). The zero-mean normalized cross-correlation function is determined by the following expression (4-2):

$\begin{matrix} {{Z\; N\; C\; C} = \frac{\sum\limits_{x \in R}{\left( {{I_{b}\left( {x + u} \right)} - {\overset{\_}{I}}_{b}} \right)\left( {{I_{r}\left( {x + v} \right)} - {\overset{\_}{I}}_{r}} \right)}}{\sqrt{\sum\limits_{x \in R}\left( {{I_{b}\left( {x + u} \right)} - {\overset{\_}{I}}_{b}} \right)^{2}}\sqrt{\sum\limits_{x \in R}\left( {{I_{r}\left( {x + v} \right)} - {\overset{\_}{I}}_{r}} \right)^{2}}}} & \left( {4\text{-}2} \right) \end{matrix}$

where I_(b), I_(r) represent the base image and the reference image, respectively, R the window area, x the position of a pixel in the window, and u, v the base positions of the windows of the base image and the reference image, respectively.

Other similarity functions (SSD (sum of squared differences), NSSD, and SAD (sum of absolute differences)) may be used based on the types of the base image I_(b) and the reference image I_(r), a required calculation velocity, etc.

According to the area base matching process in step S416, only edge points in the base image I_(b) from which the plane area Π_(f) is removed are to be processed, and only edge points on the epipolar line EP in the reference image I_(r) from which the reference plane area Π_(fr) is removed are to be processed. Therefore, the calculation load is greatly reduced, and points in the plane area are not detected. Since the calculation load is reduced, inexpensive hardware may be used for calculations.

In step S417, camera coordinates Cc of a corresponding point according to stereo measurement based on the principles of trigonometry are calculated based on points (window) on the base image I_(b) and points (window) on the reference image I_(r) where the area base matching process is satisfied.

In step S418, the camera coordinates Cc are transformed into world coordinates Cw based on the vehicle 10 which is the own vehicle. Specifically, as shown in FIG. 16, the camera coordinate system has its origin aligned with the optical center of the base camera 12 and has orthogonal coordinate axes Xc, Yc, Zc with the optical axis of the base camera 12 being aligned with the coordinate axis Zc. The world coordinate system has a coordinate axis Yw represented by the normal vector n and coordinate axes Xw, Zw represented respectively by orthogonal axes Xw, Zw on the plane Π. The coordinate axis Zw is aligned with the longitudinal direction of the vehicle, and the origin is aligned with a particular position on the vehicle (a position on the plane Π) which serves as a basis for determining the position of an object with respect to the vehicle. A vector directed from the origin of the world coordinate system to the origin of the camera coordinate system is expressed as [twx, twy, twz]^(t)=tw (twy is equal to the distance d). With each parameter thus expressed, the world coordinates Cw are expressed by the following expression (4-3):

Cw=Rw·Cc+tw  (4-3)

If the normal vector n is expressed by the expression (4-4) shown below, then a rotation matrix R_(w) is expressed by the expression (4-5) shown below:

$\begin{matrix} {\mspace{79mu} {n = \left( {n_{x},n_{y},n_{z}} \right)^{t}}} & \left( {4\text{-}4} \right) \\ {{R_{W} = {\begin{pmatrix} {\cos \; \pi} & {{- \sin}\; \pi} & 0 \\ {\sin \; \pi} & {\cos \; \pi} & 0 \\ 0 & 0 & 1 \end{pmatrix}\begin{pmatrix} {\cos \; \varphi} & 0 & {{- \sin}\; \varphi} \\ 0 & 1 & 0 \\ {\sin \; \varphi} & 0 & {\cos \; \varphi} \end{pmatrix}\begin{pmatrix} 1 & 0 & 0 \\ 0 & {\cos \; \theta} & {{- \sin}\; \theta} \\ 0 & {\sin \; \theta} & {\cos \; \theta} \end{pmatrix}\begin{pmatrix} {\cos \; \phi} & {{- \sin}\; \phi} & 0 \\ {\sin \; \phi} & {\cos \; \phi} & 0 \\ 0 & 0 & 1 \end{pmatrix}}}\mspace{20mu} \begin{matrix} {where} & {\phi = {{\arctan \left( \frac{n_{x}}{n_{y}} \right)}\mspace{14mu} \left( {{roll}\mspace{14mu} {angle}} \right)}} \\ \; & {\theta = {{\arctan \left( {- n_{z}} \right)}\mspace{14mu} \left( {{pitch}\mspace{14mu} {angle}} \right)}} \\ \; & \begin{matrix} {\varphi \text{:}\mspace{14mu} {the}\mspace{14mu} {orientation}\mspace{14mu} {of}\mspace{14mu} {the}\mspace{14mu} {camera}\mspace{14mu} {optical}} \\ {\mspace{40mu} {{axis}\mspace{14mu} {with}\mspace{14mu} {respect}\mspace{14mu} {to}\mspace{14mu} {the}\mspace{14mu} {Zw}\mspace{14mu} {axis}\mspace{11mu} \left( {{yaw}\mspace{14mu} {angle}} \right)}} \end{matrix} \end{matrix}} & \left( {4\text{-}5} \right) \end{matrix}$

For a simpler explanation, steps S413 through S418 are shown in a serial sequence in the flowchart shown in FIG. 11. Actually, steps S413 through S418 are executed for each of the edge points represented by the corrected edge image 62 to determine corresponding world coordinates Cw.

The edge points on the corrected edge image 62 can thus be expressed as a depth image 64 as shown in FIG. 17, for example, based on the depth coordinate axis Zw. In the depth image 64, points having sizes depending on the value on the coordinate axis Zw (or the distance from the origin of the world coordinate system) are shown. Each of the points may be indicated as a gradation point whose color changes depending on the value on the coordinate axis Zw. The depth image 64 is presented for the designer to confirm operation and hence may not actually be provided. However, the world coordinates Cw required to generate the depth image 64 are recorded in the given memory.

According to the processing of step S41 (steps S411 through S418), as described above, the world coordinates Cw of each of the edge points of the object can be determined based on the base image I_(b) and the reference image I_(r). Since the portion from which the plane area Π_(f) is removed is processed, the calculation load is reduced. Steps S413 through S416 may be referred to as a reference image corresponding portion searching means.

<Step S5>

Step S5 represents a process of calculating a relative velocity of an object, and comprises a subroutine of steps S51 through S55 shown in FIG. 18.

In step S51, an overlapping rate Rate of object areas is calculated from base images I_(b) at successive times.

In step S52, a center-of-gravity travel distance Lg of the object is calculated at successive times.

In step S53, an identical object is determined through threshold judgment based on the overlapping rate Rate and the center-of-gravity travel distance Lg.

In step S54, in order to determine the position of the object highly accurately, it is recalculated to determine a position vector P_(t).

In step S55, a relative velocity vector V_(obst-rel) of the object is calculated based on the position vector P_(t).

Step S5 (see FIG. 3) is constructed of these steps S51 through S55. Each of these steps will be described in greater detail below. In the description of steps S51 through S55, a processing sequence for a truck 70 (see FIG. 5) in the base image I_(b) of the detected objects will be described by way of example. Other detected objects, such as a passenger car 72 and a guardrail 74, are also processed in the same manner. Step S51 comprises a subroutine of steps S511 through S517 shown in FIG. 19.

In step S511, a template 80 a stored in step S517 at a preceding time is called from a given memory area. The template 80 a represents a recorded image, in a specified area, of the truck 70 in the base image I_(b) which corresponds to the cluster 54 a in the voting plane 50 (see FIG. 20), and is recorded as an area at a height of 1.5 m from the plane.

Conceptually, as shown in FIG. 20, a point P0 is positioned on the voting plane 50 and is given as a point in the cluster 54 a when scanned through a certain angle from the optical center O. World coordinates Cw can be calculated based on the point P0. A point Pr is located in the same width and depth positions as the point P0 and lies on the road plane Π. Since the point Pr lies on the road plane Π, its height is 0. A point Px is located in the same width and depth positions as the point P0 and has a height of 1.5 m from the road plane Π. The points Pr, Px are transformed into camera coordinates Cc. After having been transformed into camera coordinates Cc, they may be transformed into coordinates on the base image I_(b) using a perspective projection matrix. In this manner, the template 80 a corresponding to the cluster 54 a at the preceding time is determined and recorded. Similarly, a template 80 b and a template 80 c shown in FIG. 21 are recorded respectively with respect to the cluster 54 b at the preceding time which corresponds to the passenger car 72 and the cluster 54 c at the preceding time which corresponds to the guardrail 74.

Since the heights of the respective objects have been determined in step S418, the heights of the respective templates 80 a, 80 b, 80 c may be established depending on the determined heights of the objects.

In step S512, the base image I_(b) acquired in step S0 according to the main routine at the present time is read out. It is assumed that an original image before it is LOG-filtered and histogram-equalized will be used.

In step S513, texture-based template matching is performed on the base image I_(b) acquired at the present time, using each template 80 a, and each template 80 a is moved to a position of highest similarity. Specific processes for template matching may be a matching process according to the ZNCC expression (4-2), a matching process using SSD, a matching process using SAD, etc.

In step S514, the cluster 54 a determined at the present time is called based on the data recorded in step S46.

In step S515, a corresponding object position area 82 a is determined with respect to the called cluster 54 a. The object position area 82 a is determined according to the procedure described above in step S511. The object position area 82 a may be determined based on three-dimensional spatial positions of the edge points in the depth image 64 shown in FIG. 17, rather than the process determining the object position area 82 a based on the plane cluster 54 a.

In step S516, an overlapping rate Rate between the template 80 a moved in step S513 and the object position area 82 a determined in step S515 is calculated according to the following expression (5-1):

Rate=(R _(t-1) ∩R _(t))/min(R _(t-1) ,R _(t))  (5-1)

where R_(t-1) represents the area of the moved template 80 a, R_(t) the corresponding object position area 82 a, ∩ the operator indicative of the overlapping portion of the areas, and min(R_(t-1), R_(t)) a function for selecting either one of R_(t-1) and R_(t) which has a smaller area.

According to the expression (5-1), Rate=1 if the moved template 80 a and the object position area 82 a are in complete agreement with each other, and Rate=0 if there is no agreement whatsoever therebetween. Conceptually, as shown in FIG. 21, the rate of an overlapping portion R_(t-1)∩R_(t) where R_(t-1) indicative of the template and R_(t) indicative of the object position area overlap each other in the base image I_(b) is determined.

If the overlapping rate Rate is equal to or greater than a predetermined threshold value Tha (0<Tha<1), then it is temporarily judged that the cluster in the voting plane 50 at the preceding time and the cluster in the voting plane 50 at the present time are based on the same object, and a tracking process is performed. The tracking process is a process of matching clusters obtained at different times, and makes it possible to detect the motion of an object.

In step S517, the object position area 82 a determined in step S515 is recorded as a new template 80 a in the given memory. The new template 80 a is called in step S511 in a next processing cycle, as described above.

In step S51 (steps S511 through S517), as described above, the template matching process is performed based on the template 80 a, and the double tracking process is performed in order to determine the object position area 82 a from the cluster 54 a in the voting plane 50. The reliability of the tracking process is increased by determining the overlapping rate Rate of these results. Actually, the association of the tracking process determined in step S51 is finally confirmed in step S53.

The processing of step S52 will be described below. Step S52 comprises a subroutine of steps S521 through S524 shown in FIG. 22.

In step S521, the cluster 54 a determined at the present time is called based on the data recorded in step S46.

In step S522, a center g_(T) of gravity of the cluster 54 a at the present time is determined and recorded in the voting plane 50 as shown in FIG. 10.

In step S523, a center g_(O) of gravity of the cluster 54 a at the preceding time which has been recorded in step S533 at the preceding time is read out.

In step S524, a center-of-gravity travel distance Lg between the center g_(O) of gravity and the center g_(T) of gravity of the cluster 54 a is calculated.

In step S52 (steps S521 through S524), as described above, the center-of-gravity travel distance Lg between the center g_(O) of gravity at the preceding time and the center g_(T) of gravity at the present time of the cluster 54 a is determined. Therefore, clusters whose respective travel distances within a short period of time are reasonable can be associated with each other. Actually, the association of the tracking process determined in step S52 is finally confirmed in step S53.

The processing of step S53 will be described below. Step S53 comprises a subroutine of steps S531 through S534 shown in FIG. 23.

In step S531, the overlapping rate Rate determined in step S516 and the threshold value Tha are compared with each other for each corresponding object. If Rate≧Tha, then control goes to step S532. If Rate<Tha, then control goes to step S534.

In step S532, the center-of-gravity travel distance Lg determined in step S524 and a threshold value Thb are compared with each other for each corresponding object. If Lg≦Thb, then control goes to step S533. If Lg>Thb, then control goes to step S534. The threshold value Thb is established as a fixed value representative of a reasonable distance that an object can travel in a processing period, in view of the traveling velocity of the own vehicle and the traveling velocity of an oncoming vehicle.

In step S533, two associated objects are determinably recognized and recorded as an identical object. The center g_(O) of gravity is changed as g_(O)←g_(T) and stored in the given memory.

In step S534, two associated objects are recognized as different objects. In this case, a registration process is performed to recognize an object that has not been associated, as a new object that has entered the image capturing range, based on a succession of images, or alternatively, a deleting process is performed to delete an object that has not been associated, as an object that has been moved out of the image capturing range.

In step S53 (steps S531 through S534), as described above, it is possible to confirm more reliably whether two objects that have been associated in the processing up to step S52 are an identical object or not, based on the overlapping rate Rate and the center-of-gravity travel distance Lg.

Steps S531 through S534 have been described above as being executed with respect to two objects that have temporarily been associated with each other in advance. However, these steps may be carried out on all of each object detected at the preceding time and each object detected at the present time for association.

The threshold value Thb used in step S532 has been described as a fixed value. However, a threshold value Th(Zg) as a function that varies based on the distance Zg from the vehicle 10 to the center g_(O) of gravity in the direction of the coordinate axis Zw may be used for threshold-based determination. In this case, if the distance to the center g_(O) of gravity of a certain object in the direction of the coordinate axis Zw is represented by Zg1, then the threshold value is represented by Th(Zg1). Similarly, a threshold value Th(|V_(v)|) as a function that varies based on the own vehicle velocity |V_(v)| may alternatively be used for threshold-based determination.

The processing of steps S54, S55 will be described below. Step S54 comprises steps S541 through S544 shown in FIG. 24, and step S55 comprises steps S551 through S553 shown in FIG. 26.

In step S541, an attention point Pc on an object in the base image I_(b) is identified. The attention point Pc is established in the area of the template 80 a which has been moved by the template matching process. For example, if the attention point Pc is identified as a feature point such as a central point of the template 80 a, a corner of the object, or the like, then the attention point Pc is identified as substantially the same point on the object at all times.

In step S542, an epipolar line EP corresponding to the attention point Pc is established on the reference image I_(r). At this time, since an approximate distance up to the truck 70 can be calculated using the cluster 54 a, the epipolar line EP can be set to a necessarily and sufficiently short length, based on the calculated distance.

A process of calculating the approximate distance of the attention point Pc using the cluster will be described below. First, a coordinate Zw is determined from the center g_(T) (see FIG. 10) of gravity of the cluster 54 a. The determined coordinate Zw is temporarily set to the coordinate Zw of the attention point Pc. The coordinate Zw and image coordinates (u_(pc), v_(pc)) of the attention point Pc are substituted into the expression (5-2) shown below to calculate a corresponding coordinate Xw. In the expression (5-2), λ represents degrees of freedom which are represented by a constant multiplication.

$\begin{matrix} {{\lambda \begin{bmatrix} u_{pc} \\ v_{pc} \\ 1 \end{bmatrix}} = {{A_{b}\left( R_{W}^{t} \middle| {{- R_{W}^{t}}T_{W}} \right)}\begin{bmatrix} X_{W} \\ Y_{W} \\ Z_{W} \\ 1 \end{bmatrix}}} & \left( {5\text{-}2} \right) \end{matrix}$

A straight line is then established which passes through the position (Xw, Zw) thus determined on the voting plane 50 and the position (twx, twz) of the base camera. The points of the cluster 54 a are then searched for along the straight line, and the coordinate Zw of the point which is closest to the vehicle 10 is used as representing an approximate distance of the attention point Pc.

In step S543, the area base matching process is performed on the epipolar line EP of the reference image I_(r) with respect to the point on the base image I_(b) which corresponds to the attention point Pc, in the same manner as with step S416.

In step S544, camera coordinates Cc of a corresponding point according to stereo measurement are calculated based on points on the base image I_(b) and points on the reference image I_(r) where the area base matching process is satisfied, in the same manner as with step S417. Furthermore, the camera coordinates Cc are transformed into world coordinates Cw in the same manner as with step S418. The world coordinates Cw, which represents the determined position of the object, is expressed as a two-dimensional position vector P_(t) on the voting plane 50, as shown in FIG. 25.

In step S551 shown in FIG. 26, a position vector P_(t-1) of the object detected at the preceding time is read out. The position vector P_(t-1) is recorded in the given memory in step S533 in the processing cycle at the preceding time.

In step S552, a relative velocity vector (movement vector) V_(obst-rel) of the object is calculated according to the following expression (5-3):

V _(obst) _(—) _(rel)=(P _(t) −P _(t-1))/Δt  (5-3)

where Δt represents the processing period. The relative velocity vector V_(obst-rel) is determined as a change in the position vector P_(t) per unit time.

In step S553, the position vector P_(t) is assigned to P_(t-1) (P_(t-1)←P_(t)) and recorded in the given memory for use in a next processing cycle. The position vector P_(t) which is recorded has been updated according to the same processing sequence as steps S541 through S544 with respect to the object position area 82 a stored as the new template 80 a in step S517.

According to the processing of steps S54, S55, since the epipolar line EP is set to a sufficiently short length, the frequency of matching errors caused in the area base matching process in step S543 is sufficiently reduced to allow the distance of the object to be calculated highly accurately. As the attention point Pc is set to substantially the same point on the object at all times, the relative velocity vector V_(obst-rel) which represents relative movement over time of the object including movement in the direction of the width (the direction of the coordinate axis Xw) can accurately be calculated.

As a result, vectors Vr1, Vr2, Vr3 which are relative velocity vectors V_(obst-rel) of the truck 70, the passenger car 72, and the guardrail 74 are displayed as shown in FIG. 25. As can be seen from FIG. 25, it can be judged from the vector Vr1 that the truck 70 is changing its path to the left, from the vector Vr2 that the passenger car 72 is traveling forward at a velocity slightly higher than the vehicle 10, and from the vector Vr3 that the guardrail 74 which is a still object is moving relatively in a direction that is opposite to the traveling direction of the vehicle 10. The own vehicle velocity vector V_(V) of the vehicle 10 shown in FIG. 25 is determined in steps S6, S7.

A process of establishing an epipolar line will be described below. For three-dimensional stereo measurement, the position of the observational point M1 on the base image I_(b) and the position of the observational point M1 on the reference image I_(r) need to be determined individually. As shown in FIG. 27, the observational point M1 is projected onto a point m_(b) on the base image I_(b), and the point m_(b) is present on a straight line Le passing through the observational point M1 and the optical center O of the base camera 12. If points on the straight line Le are searched, then the observational point M1 can be found, and the straight line Le projected onto the reference image I_(r) becomes an epipolar line EP. For associating the observational point M1 projected onto the base image I_(b) with the reference image I_(r), points on the epipolar line EP in the reference image I_(r) may be searched. Points M0, M2 in FIG. 27 are other points projected onto the same point m_(b) and located on the straight line Le.

Equations for epipolar constraint will be determined below. Using the rotation matrix R and the translation vector t, the relationship Xr=R·Xb+t is satisfied between a reference camera coordinate Xr and a base camera coordinate Xb.

At this time, a normalized image coordinate X̂ba of the base camera 12, a normalized image coordinate X̂ra of the reference camera 14, and the translation vector t are present on the same plane. Since the scalar triple product is 0, the following equation is satisfied:

{tilde over (X)}ra·(t×R·{tilde over (X)}ba)={tilde over (X)}ra ^(t) [t] _(x) R·{tilde over (X)}ba  (5-4)

where

$\begin{matrix} {\lbrack t\rbrack_{X} = \begin{pmatrix} 0 & {- t_{3}} & t_{2} \\ t_{3} & 0 & {- t_{1}} \\ {- t_{2}} & t_{1} & 0 \end{pmatrix}} & \left( {5\text{-}5} \right) \end{matrix}$

where t1, t2, t3 represents elements of the translation vector t. By substituting m̂_(b)=A_(b)X̂ba, m̂_(r)=A_(r)X̂ra based on the relationship between the normalized image coordinates and the image coordinates, a fundamental matrix F is expressed by the following expressions (5-6), (5-7):

F=A_(r) ⁻¹[t]_(x)RA_(b) ⁻¹  (5-6)

{tilde over (m)}_(r) ^(t)F{tilde over (m)}_(b)=0  (5-7)

According to the expression (5-7), if l′=Fm̂ when the position at which the observational point M1 in the space is projected onto the base image I_(b) is represented by m, then because m̂′l′=0, the following equation is satisfied in the reference image I_(r):

l ₁ ′u′+l ₂ ′v′+l ₃′=0  (5-8)

representing an epipolar line EP corresponding to the observational point M1 in the reference image I_(r). In the equation (5-8), “′” indicates the reference image, l₁′, l₂′, l₃′ represent parameters of the epipolar line EP in the reference image, and u′, v′ represent image coordinates of the reference image.

If an approximate position of the observational point M1 is known, then the length of the straight line Le may be limited so as to set the epipolar line EP to a short length.

If l=F^(t)m′ when the position at which the observational point M1 in the space is projected onto the reference image I_(r) is represented by m′, then because l^(t)m=0, the following equation is satisfied in the reference image I_(r):

l ₁ u+l ₂ v+l ₃=0  (5-9)

representing an epipolar line EP in the base image I_(b) at the observational point M1. The parameters u, u′ used in the explanation of the epipolar line EP are different from vectors u, u′ to be described later.

<Step S6>

Step S6 is a process of generating a VPP image representing the road plane Π as virtually seen from above in order to determine the own vehicle velocity vector V_(v) (see FIG. 25) of the vehicle 10. Step S6 comprises a subroutine of steps S61 through S63 shown in FIG. 28. In step S61, a transformation equation H_(VPP) for transforming the base image I_(b) into a VPP image (hereinafter referred to as “VPP transformation”) is calculated. Thereafter, in step S62, the base image I_(b) is transformed into a VPP image I_(V) according to the transformation equation H_(VPP), and the VPP image I_(V) is recorded (see FIG. 33). In step S63, the plane area Π_(f) is VPP-transformed according to the same transformation equation H_(VPP), and recorded (see FIG. 34). Each of steps S61 through S63 will be described in detail below.

A virtual camera for capturing the VPP image I_(V) is assumed.

In step S611 shown in FIG. 29, an inverse matrix A_(b) ⁻¹ of the internal parameter A_(b) of the base camera 12 is read. The internal parameter A_(b) is expressed by the following expression (6-1):

$\begin{matrix} {A_{b} = \begin{pmatrix} \alpha_{1} & S_{1} & C_{x\; 1} \\ 0 & \beta_{1} & C_{y\; 1} \\ 0 & 0 & 1 \end{pmatrix}} & \left( {6\text{-}1} \right) \end{matrix}$

where α₁, β₁, s₁, C_(x1), C_(y1) represent constants determined by calibration of the base camera 12.

In step S612, the normal vector n and the distance d (see FIG. 16) which are positional attitude parameters with respect to the road plane Π are read.

In step S613, using the normal vector n and the distance d, a rotation matrix R_(n) for bringing a vector e_(OZ) (see FIG. 30) which represents the optical axis of the base camera 12 into alignment with the normal vector n, is calculated according to the following expressions (6-2) through (6-5):

$\begin{matrix} {\mspace{79mu} {e_{OZ} = \left( {0,0,1} \right)^{t}}} & \left( {6\text{-}2} \right) \\ {\mspace{79mu} {{\cos \; \theta_{n}} = \frac{n \cdot e_{OZ}}{{n}{e_{OZ}}}}} & \left( {6\text{-}3} \right) \\ {\mspace{79mu} {c_{n} = {\left( {c_{n\; 1}\mspace{14mu} c_{n\; 2}\mspace{11mu} c_{n\; 3}} \right)^{t} = \frac{n \times e_{OZ}}{{n \times e_{OZ}}}}}} & \left( {6\text{-}4} \right) \\ {R_{n} = \begin{pmatrix} {{c_{n\; 1}^{2}\left( {1 - {\cos \; \theta_{n}}} \right)} + {\cos \; \theta_{n}}} & {{c_{n\; 1}{c_{n\; 2}\left( {1 - {\cos \; \theta_{n}}} \right)}} - {c_{n\; 3}\sin \; \theta_{n}}} & {{c_{n\; 1}{c_{n\; 3}\left( {1 - {\cos \; \theta_{n}}} \right)}} + {c_{n\; 2}\sin \; \theta_{n}}} \\ {{c_{n\; 1}{c_{n\; 2}\left( {1 - {\cos \; \theta_{n}}} \right)}} + {c_{n\; 3}\sin \; \theta_{n}}} & {{c_{n\; 2}^{2}\left( {1 - {\cos \; \theta_{n}}} \right)} + {\cos \; \theta_{n}}} & {{c_{n\; 2}{c_{n\; 3}\left( {1 - {\cos \; \theta_{n}}} \right)}} - {c_{n\; 1}\sin \; \sigma_{n}}} \\ {{c_{n\; 1}{c_{n\; 3}\left( {1 - {\cos \; \theta_{n}}} \right)}} - {c_{n\; 3}\sin \; \theta_{n}}} & {{c_{n\; 2}{c_{n\; 3}\left( {1 - {\cos \; \theta_{n}}} \right)}} + {c_{n\; 1}\sin \; \theta_{n}}} & {{c_{n\; 3}^{2}\left( {1 - {\cos \; \theta_{n}}} \right)} + {\cos \; \theta_{n}}} \end{pmatrix}} & \left( {6\text{-}5} \right) \end{matrix}$

These expressions (6-2) through (6-5) will be described below with reference to FIG. 30. In the expressions, portions enclosed by the vertical double lines indicate a norm, the vector e_(OZ) is a unit vector of the coordinate axis Zc (see FIG. 16) which is the optical axis of the camera coordinate system. c_(n) represents a unit vector perpendicular to the normal vector n and the vector e_(OZ), and the angle θn is an angle formed between the normal vector n and the vector e_(OZ). Vectors e′_(OX), e′_(OY), e′_(OZ) shown in FIG. 30 are orthogonal unit vectors representing a virtual camera coordinate system. The dot-and-dash line represents the longitudinal direction of the vehicle 10.

In step S614, a projected distance, a scale, and an image center are specified, and an internal parameter A_(VPP) of the virtual camera which views the road plane Π from above is established. The internal parameter A_(VPP) is a matrix for transforming an image from virtual camera coordinates into image coordinates, and is expressed by the following expression (6-6):

$\begin{matrix} {A_{vpp} = \begin{pmatrix} \alpha_{vpp} & 0 & C_{x\_ vpp} \\ 0 & \beta_{vpp} & C_{y\_ vpp} \\ 0 & 0 & 1 \end{pmatrix}} & \left( {6\text{-}6} \right) \end{matrix}$

where α_(VPP)=d_(VPP)·k_(X-VPP), β_(VPP)=d_(VPP)·k_(Y-VPP), d_(VPP) represents the projected distance [m], k_(X-VPP) and k_(Y-VPP) represent scales [pixels/m] in the X, Y coordinate directions of the VPP image I_(V), and C_(X-VPP) and C_(Y-VPP) represent X and Y coordinates of the center of the VPP image I_(V), respectively.

When the distance d which is a parameter of the road plane is specified as the projected distance according to the internal parameter A_(VPP), it is projected onto the detected road plane Π.

In step S615, a rotation matrix R_(V) which is a transformation equation for rotating the image through an angle θ_(V) and an angle −φ, in order to bring the longitudinal direction of the vehicle into alignment with the vertical axis of the VPP image, is calculated. Specifically, a vector u, as viewed from the VPP camera coordinate system, representing the unit vector e_(OZ) in the direction of the optical axis of the base camera 12 is established based on FIG. 30 and the expression (6-7), and a vector u′ representing the vector u as orthogonally projected onto an e′_(OX), e′_(OY) plane in the virtual camera coordinate system is established based on the expression (6-8).

u=R _(n) e _(OZ)=(u _(x) ,u _(y) ,u _(z))^(t)  (6-7)

u′=(u _(x) ,u _(y),0)^(t)  (6-8)

When the vectors u, u′ are thus defined, the angle θ_(V) represents an angle formed between the vector u′ and the virtual camera coordinate axis e′_(OY), and expressed by the following expression (6-9):

$\begin{matrix} {\theta_{v} = {\arctan \left( \frac{u_{x}}{u_{y}} \right)}} & \left( {6\text{-}9} \right) \end{matrix}$

The angle φ is an angle of the vector e_(OZ) as the camera optical axis with respect to the longitudinal direction of the vehicle, and is determined in advance. The rotation matrix R_(V) to be determined is expressed by the following expression (6-10):

$\begin{matrix} \begin{matrix} {R_{v} = {{{Rotate}\left( {e_{OZ}^{\prime} - \varphi} \right)}\mspace{11mu} {{Rotate}\left( {e_{OZ}^{\prime},\theta_{v}} \right)}}} \\ {= {\begin{pmatrix} {\cos \left( {- \varphi} \right)} & {- {\sin \left( {- \varphi} \right)}} & 0 \\ {\sin \left( {- \varphi} \right)} & {\cos \left( {- \varphi} \right)} & 0 \\ 0 & 0 & 1 \end{pmatrix}\begin{pmatrix} {\cos \; \theta_{v}} & {{- \sin}\; \theta_{v}} & 0 \\ {\sin \; \theta_{v}} & {\cos \; \theta_{v}} & 0 \\ 0 & 0 & 1 \end{pmatrix}}} \end{matrix} & \left( {6\text{-}10} \right) \end{matrix}$

In step S616, the transformation equation H_(VPP) for VPP transformation is calculated based on A_(b) ⁻¹, R_(n), R_(V), A_(VPP). The transformation equation H_(VPP) is expressed by the following expression (6-11) where R_(VPP)=R_(V)R_(n):

$\begin{matrix} \begin{matrix} {H_{vpp} = {A_{vpp}R_{v}R_{n}A_{b}^{- 1}}} \\ {= {A_{vpp}R_{vpp}A_{b}^{- 1}}} \end{matrix} & \left( {6\text{-}11} \right) \end{matrix}$

According to the expression (6-11), a process equivalent to the successive transformation of the base image I_(b) with the matrixes A_(b) ⁻¹, R_(n), R_(V) and A_(VPP) is performed. Actually, the transformation can be performed once according to the single transformation equation H_(VPP). However, the transformation with the matrixes A_(b) ⁻¹, R_(n), R_(V) and A_(VPP) will be described below for an easier conceptual understanding of the process of the transformation.

First, when the base image I_(b) (see FIG. 5) is transformed with the inverse matrix A_(b) ⁻¹, it is transformed from image coordinates into the camera coordinate system, thereby producing a camera coordinate system base image I_(bc) shown in FIG. 31.

Then, the camera coordinate system base image I_(bc) is transformed with the rotation matrix R_(n). The camera coordinate system base image I_(bc) is rotated through the angle θ_(n) into a first transformed image I_(V1) parallel to the road plane Π with a far area thereof enlarged. As shown in FIG. 32, the first transformed image I_(V1) is inclined at an angle (θ_(V)−φ) to the vertical axis.

The first transformed image I_(V1) is transformed with the rotation matrix R_(V). The first transformed image I_(V1) is rotated through the angle (θ_(V)−φ) into a second transformed image I_(V2) with the longitudinal direction of the vehicle and the vertical axis of the VPP image being aligned with each other.

Finally, the second transformed image I_(V2) is transformed with the internal parameter A_(VPP) of the virtual camera. The second transformed image I_(V2) is transformed in scale to produce a VPP image I_(V) (see FIG. 33) having a desired size.

The transformation equation H_(VPP) is constructed of the series of matrixes A_(VPP)R_(V)R_(n)A_(b) ⁻¹. The base image I_(b) is VPP-transformed into the VPP image I_(V) (see FIG. 33) by the transformation equation H_(VPP). As described above, the VPP transformation is performed in step S62. The obtained VPP image I_(V) is recorded in the memory.

The VPP image I_(V) is defined by the setting of the internal parameter A_(VPP) such that, as shown in FIG. 33, the origin is located at an upper left corner of the image, the transverse direction of the vehicle is the X direction (rightward direction in FIG. 33), and the longitudinal direction of the vehicle is the Y direction (downward direction in FIG. 33).

As can be seen from FIG. 33 that the VPP image I_(V) is an image representing the road plane Π as viewed from above at a large distance with the road having a substantially constant width. The truck 70 and the passenger car 72 in the base image I_(b) are displayed as distorted such that the upper portion of the image is enlarged.

Thereafter, in step S63, the plane area Π_(f) (see FIG. 5) is VPP-transformed by the transformation equation H_(VPP), producing a VPP plane image I_(Vf) (see FIG. 34) which represents the plane area Π_(f) as viewed from above and which is recorded. The VPP plane image I_(Vf) is indicative of the area of the road plane Π in the VPP image I_(V). The obtained VPP plane image I_(Vf) is stored in the memory. The VPP plane image I_(Vf) is of the same shape as the road plane. In the example shown in FIG. 34, the VPP plane image I_(Vf) is substantially V-shaped and is free from the other truck 70 in the front, structures which are not horizontal such as a road side region, etc., and surfaces which are not in the same level as the road plane.

<Step S7>

Step S7 is a process for determining the own vehicle velocity vector V_(v) (see FIG. 25) of the vehicle 10 based on the VPP image I_(V) and the VPP plane image I_(Vf) which have been determined in step S6. Step S7 comprises a subroutine of steps S71 through S77 shown in FIG. 35. In the description which follows, a VPP image I_(V) and a VPP plane image I_(Vf) which are obtained in the processing cycle at the present time are referred to as a VPP image I_(V)(t) and a VPP plane image I_(Vf)(t), and those which have been obtained in the processing cycle at the preceding time are differently referred to as a VPP image I_(V)(t−1) and a VPP plane image I_(Vf)(t−1). In the world coordinate system, the longitudinal direction of the vehicle 10 is defined as the coordinate axis Zw (see FIG. 10). Since the longitudinal direction of the vehicle 10 is defined as the Y axis in the VPP image I_(V), as described above, parameters corresponding to the longitudinal direction of the vehicle 10 are denoted with a suffix “Y” or “y” in the description, given below, of step S7.

In step S71, the VPP image I_(V)(t−1) and the VPP plane image I_(Vf)(t−1) in the processing cycle at the preceding time, and image matching movement quantities ΔX₀, ΔY₀, Δθ_(yaw-0) are called. The image matching movement quantities ΔX₀, ΔY₀, Δθ_(yaw-0) are parameters recorded in step S77 in the processing cycle at the preceding time, and represent a shift due to matching between the VPP image I_(V)(t) and the VPP image I_(V)(t−1) at the preceding time.

In step S72, search ranges for matching between the VPP image I_(V)(t) and the VPP image I_(V)(t−1) are established. Specifically, ranges ΔX=ΔX_(MIN) to ΔX_(MAX), ΔY=ΔY_(MIN) to ΔY_(MAX), and Δθ_(yaw)=Δθ_(yaw-MIN) to Δθ_(yaw-MAX) having predetermined widths around the image matching movement quantities ΔX₀, ΔY₀, Δθ_(yaw-0) at their centers are established. In step S73, the VPP image I_(V)(t) and the VPP image I_(V)(t−1) are relatively moved in the search ranges established in step S72 for thereby performing a VPP image matching process. Since the search ranges are established based on the image matching movement quantities ΔX₀, ΔY₀, Δθ_(yaw-0), a period of time required to carry out the VPP image matching process may be short. Since the own vehicle velocity vector V_(V) does not change rapidly, a portion where similarity is the greatest does not deviate from the search ranges around the image matching movement quantities ΔX₀, ΔY₀, Δθ_(yaw-0) at their centers. Details of the VPP image matching process in step S73 will be described later (see FIG. 36).

In step S74, the results of the VPP image matching process which are determined in step S73 are referred to in detecting a portion where similarity between the VPP image I_(V)(t) and the VPP image I_(V)(t−1) is the greatest (a portion where NSSD (ΔX, ΔY, Δθ_(yaw)) is the smallest, as described later). A shift between the VPP image I_(V)(t) and the VPP image I_(V)(t−1) in the detected portion is determined as a movement quantity move (ΔX_(f), ΔY_(f), Δθ_(yaw-f)). ΔX_(f), ΔY_(f), Δθ_(yaw-f) represent the respective values of ΔX, ΔY, Δθ_(yaw) in the portion where similarity between the VPP image I_(V)(t) and the VPP image I_(V)(t−1) is the greatest.

In step S75, the magnitude of the own vehicle velocity vector V_(V) of the vehicle 10 is determined based on the movement quantity move (ΔX_(f), ΔY_(f)) according to the expressions (7-1) through (7-3) shown below.

$\begin{matrix} {v_{x} = {\frac{d_{vpp}}{\alpha_{vpp}}{\frac{\Delta \; x_{f}}{\Delta \; t}\mspace{14mu}\left\lbrack {m\text{/}s} \right\rbrack}}} & \left( {7\text{-}1} \right) \\ {v_{z} = {\frac{d_{vpp}}{\beta_{vpp}}{\frac{\Delta \; y_{f}}{\Delta \; t}\mspace{14mu}\left\lbrack {m\text{/}s} \right\rbrack}}} & \left( {7\text{-}2} \right) \\ {{V_{v}} = {\sqrt{v_{x}^{2} + v_{z}^{2}}\mspace{11mu}\left\lbrack {m\text{/}s} \right\rbrack}} & \left( {7\text{-}3} \right) \end{matrix}$

where Vx, Vz represent the velocities in the respective transverse and longitudinal directions of the vehicle 10, and d_(VPP), α_(VPP), β_(VPP) the coefficient and numerical values defined by the above expression (6-6). As described above, Δt represents the processing period. In the expressions (7-2), (7-3), the suffix “z”, rather than “y”, is used in the velocity Vz in the longitudinal direction of the vehicle 10 because the coordinates are transformed from the VPP image coordinates back into the world coordinate system for consistency with other processes.

Since the magnitude of the own vehicle velocity vector V_(V) is expressed as the length of an oblique line made up of velocity components in two orthogonal directions as well known in the art, the expression (7-3) is satisfied.

The magnitude of the own vehicle velocity vector V_(V) and the angle θ_(YAW) are determined according to the expressions (7-3), (7-4), and the own vehicle velocity vector V_(V) is thus determined. The own vehicle velocity vector V_(V) is shown in FIG. 25. The angle θ_(YAW) may be used as the rotational angle of the vehicle 10.

In order to determine the rotational angle of the vehicle 10 more strictly, the VPP image I_(V)(t−1) may not only be translated in the ΔX and ΔY directions, but also be moved and rotated, and then similarity may be calculated. In this case, ranges ΔX=ΔX_(MIN) to ΔX_(MAX), ΔY=ΔY_(MIN) to ΔY_(MAX) having predetermined widths around the image matching movement quantities ΔX₀, ΔY₀ at their centers and a rotational angle ω=Δθ_(MIN) to Δθ_(MAX) are established, and the VPP image I_(V)(t−1) is moved with three degrees of freedom.

In step S76, the own vehicle velocity vector V_(V) and the angle θ_(YAW) are recorded. In order to use ΔX_(f), ΔY_(f), Δθ_(yaw-f) determined in step S74, as image matching movement quantities ΔX₀, ΔY₀, Δθ_(yaw-0) for a next processing cycle, the substitutions ΔX₀←ΔX_(f), ΔY₀←ΔY_(f), Δθ_(yaw-0)←Δθ_(yaw-f) are performed and then recorded.

A first processing method of VPP image matching in step S73 will be described below. The first processing method comprises steps S731 through S735 shown in FIG. 36. The processing of steps S731 through S735 is carried out individually in the search ranges ΔX=ΔX_(MIN) to ΔX_(MAX), ΔY=ΔY_(MIN) to ΔY_(MAX), and Δθ_(yaw)=Δθ_(yaw-MIN) to Δθ_(yaw-MAX) established in step S72. However, the description of repetitive control is omitted, and only one processing cycle will be described below.

In step S731, the VPP plane image I_(Vf)(t−1) is rotated through Δθ_(yaw) established at the present time and moved in the directions of ΔX and ΔY (see “S731” shown in FIG. 37). The center of rotation is placed at the position (C_(x-VPP), C_(y-VPP)) of the optical center of the VPP image.

In step S732, a common area R (ΔX, ΔY, Δθ_(yaw)) of the VPP plane image I_(Vf)(t) and the VPP plane image I_(Vf)(t−1) moved in step S731 is determined (see “S732” shown in FIG. 37).

In step S733, the VPP image I_(V)(t−1) is rotated through Δθ_(yaw) established at the time and moved in the directions of ΔX and ΔY (see “S733” shown in FIG. 37).

In step S734, based on the common area R (ΔX, ΔY, Δθ_(yaw)), the VPP image I_(V)(t), and the moved VPP image I_(V)(t−1), NSSD is calculated for VPP image matching according to the following expression (7-4):

$\begin{matrix} {{{NSSD}\left( {{\Delta \; x},{\Delta \; y},{\Delta \; \theta_{yaw}}} \right)} = {\frac{1}{N}{\sum\limits_{x_{i} \in {({{\Delta \; x},{\Delta \; y},{\Delta \; \theta_{yaw}}})}}\left\{ {{{I_{v}\left( {t - 1} \right)}\mspace{11mu} {{move}\left( {{\Delta \; x},{\Delta \; y},{\Delta \; \theta_{yaw}}} \right)}\left( x_{i} \right)} - {{I_{v}(t)}\left( x_{i} \right)}} \right\}^{2}}}} & \left( {7\text{-}4} \right) \end{matrix}$

where x_(i) represents the coordinates of pixels contained in the common area R (ΔX, ΔY, Δθ_(yaw)), N the total number of pixels contained in the common area R (ΔX, ΔY, Δθ_(yaw)), and I_(V)(t−1) move (ΔX, ΔY) an image produced by rotating the VPP image I_(V)(t−1) through Δθ_(yaw) and moving the VPP image I_(V)(t−1) by ΔX, ΔY in step S734.

According to the expression (7-4), the sum of squares of luminance differences per pixel between the VPP image I_(V)(t) and the image produced by rotating the VPP image I_(V)(t−1) through Δθ_(yaw) and moving the VPP image I_(V)(t−1) by ΔX, ΔY is determined as a normalized value. In step S735, NSSD (Δx, Δy, Δθ_(yaw)) is recorded as similarity with respect to each movement quantity move (Δx, Δy, Δθ_(yaw)). Since NSSD (Δx, Δy, Δθ_(yaw)) is normalized, mutual comparison is made possible regardless of whether the area of the common area R (ΔX, ΔY, Δθ_(yaw)) is large or small.

According to the processing of step S7, robustness is high because no corresponding point is searched for. Since a VPP image parallel to the plane is generated based on the positional attitude parameters of the plane, vibration resistance is high because of no effects of changes in the vehicle attitude. Actually, some patterns and feature points such as ground patterns are present in the road plane Π, although the road plane Π has irregular patterns. Thus, the own vehicle velocity vector V_(V) can be determined based on those portions.

Furthermore, inasmuch as the VPP image matching process is performed within the common area R (ΔX, ΔY, Δθ_(yaw)) based on the road plane area Π_(f), superfluous portions such as other vehicles and road side regions are deleted, and highly accurate, fast calculations are performed.

ZNCC, referred to above, rather than NSSD, may be used as similarity in the VPP image matching process.

A second processing method of VPP image matching in step S73 will be described below. The second processing method is basically the same as the density gradient method described in step S1 and Non-patent Document 1, and converges two images so that they will overlap each other maximally while slightly changing a movement rotation matrix M which corresponds to the projection transformation matrix H.

First, a movement rotation matrix M as an initial value that is adequately close to a true value is established, and the VPP image I_(V)(t−1) is moved and rotated according to the expression (7-5) shown below. I_(r)(x) represents a luminance value at the coordinates x (x, y) of the VPP image I_(V)(t−1). The movement rotation matrix M is a 3×3 matrix. The initial value of the movement rotation matrix M may be a value calculated in the step at the preceding time.

Ĩ _(vpp(t-1))({tilde over (x)})=I _(vpp(t-1))(M{tilde over (x)})  (7-5)

where “˜” represents a luminance value after the transformation has been made.

If it is assumed that when each parameter of the movement rotation matrix M is slightly changed, the coordinates x (x, y) on the transformed VPP image I_(V)(t−1) are changed to coordinates x″ (x″, y″), then the following relationship is obtained:

{tilde over (x)}″˜(I+D_(x)){tilde over (x)}  (7-6)

where I represents a 3×3 unit matrix, and D represents a slightly changed 3×3 matrix having, as parameters thereof, slightly changed quantities of the respective parameters of the movement rotation matrix M, the slightly changed 3×3 matrix D being expressed by the following expression (7-7):

$\begin{matrix} {D = \begin{pmatrix} 0 & {- \omega} & {dx} \\ \omega & 0 & {dy} \\ 0 & 0 & 0 \end{pmatrix}} & \left( {7\text{-}7} \right) \end{matrix}$

where ω represents a slight rotational angle, and dx, dy slight movement quantities in the x and y directions. ω, dx, and dy may also be referred to as a single parameter Θ. Using the relationship based on the expressions (7-5), (7-6), an evaluation function E(Θ) using the parameter Θ as an argument and indicating an overlapping state of the moved and rotated VPP image I_(V)(t−1) and the VPP image I_(V)(t) is expressed by the following expression (7-8):

$\begin{matrix} {{E(\Theta)} = {\sum\limits_{x_{i} \in R_{plane}}\left\lbrack {{{\overset{\sim}{I}}_{{vpp}{({t - 1})}}\left( {\overset{\sim}{x}}_{i}^{''} \right)} - {I_{{vpp}{(t)}}\left( {\overset{\sim}{x}}_{i} \right)}} \right\rbrack^{2}}} & \left( {7\text{-}8} \right) \end{matrix}$

where “i” represents a pixel number, and R_(plane) represents an area corresponding to the road plane Π in the VPP plane images I_(Vf)(t−1), I_(Vf)(t).

The expression (7-8) is equivalent to the expression (1-5). Also, the base image I_(b) and the VPP image I_(V)(t), the reference image I_(r) and the VPP image I_(V)(t−1), and the matrix Dx and the matrix D correspond to each other.

According to a method similar to the above method, therefore, g_(i) (luminance gradient), e_(i) (luminance difference), and Jacobian JΘ_(i) can be calculated, and a slightly changed matrix D can be determined by the least-squares method.

Using the slightly changed matrix D thus determined, the movement rotation matrix M is updated according to the following expression (7-9):

M←M(I+D)  (7-9)

Using the movement rotation matrix M determined by the expression (7-9), the process of calculating the value of the evaluation function E(Θ) according to the expression (7-8) is repeated. In the repeated process, the movement rotation matrix M is updated as M←M(I+D) using the slightly changed matrix D that is obtained by the least-squares method. From the components of M at the time the value of the evaluation function E(Θ) converges to a predetermined value or smaller, Δθ_(yaw), ΔX, ΔY can be determined according to the expression (7-10).

$\begin{matrix} {M = \begin{pmatrix} {\cos \; \Delta \; \theta_{yaw}} & {{- \sin}\; {\Delta\theta}_{yaw}} & {{{- C_{x\_ vpp}}\cos \; {\Delta\theta}_{yaw}} + {C_{y\_ vpp}\sin \; {\Delta\theta}_{yaw}} + C_{x\_ vpp} + {\Delta \; X}} \\ {\sin \; \Delta \; \theta_{yaw}} & {\cos \; {\Delta\theta}_{yaw}} & {{{- C_{x\_ vpp}}\sin \; {\Delta\theta}_{yaw}} + {C_{y\_ vpp}\cos \; {\Delta\theta}_{yaw}} + C_{y\_ vpp} + {\Delta \; Y}} \\ 0 & 0 & 1 \end{pmatrix}} & \left( {7\text{-}10} \right) \end{matrix}$

According to the second processing method in step S73, Δθ_(yaw), ΔX, ΔY determined by the first processing method are used as initial values, and hence Δθ_(yaw), ΔX, ΔY can be determined more accurately.

<Step S8>

Step S8 is a process of determining whether a detected object is a still object or a moving object. Step S8 comprises a subroutine of steps S81 through S84 shown in FIG. 38.

In step S81, the vectors Vr1, Vr2, Vr3 representing relative velocities of respective objects determined in step S55 are read. These vectors are indicated by the arrows in FIG. 25.

In step S82, the own vehicle velocity vector V_(V) of the vehicle 10 determined in step S7 is read. The own vehicle velocity vector V_(V) of the vehicle 10 is indicated as having its base point at the origin in FIG. 25.

In step S83, absolute velocity vectors V_(ABS)N (N=1, 2, 3, . . . ) of the respective detected objects are calculated. The absolute velocity vectors V_(ABS)N are determined by a vector addition represented by V_(ABS)N=V_(r)N+V_(V)′ where V_(V)′ represents a velocity component due to the motion of the vehicle, contained in the relative velocity V_(r)N. FIG. 39 shows the absolute velocity vectors V_(ABS)N determined of the respective objects. As can be seen from FIG. 39, V_(ABS) 3≈0 for the guardrail 74 which is a still object.

In step S84, it is checked whether each of the detected objects is a still object or a moving object based on the absolute velocity vector V_(ABS)N. Specifically, the magnitude |V_(ABS)N| of the absolute velocity vector of each object and a threshold value Th_(ABS) are compared with each other. If Th_(ABS)≧|V_(ABS)N|, then it is judged that the object under test is a still object. If |V_(ABS)N|>Th_(ABS), then it is judged that the object under test is a moving object. Therefore, the guardrail 74 where V_(ABS) 3≈0 is identified as a still object, and the truck 70 and the passenger car 72 as moving objects.

According to the processing of step S8, therefore, the absolute velocity of a detected object can be determined accurately, and it can be judged accurately whether the object is a still object or not. Information as to the judged results may be given to a proximity reminding means between the vehicle 10 and objects.

According to the processing of steps S7, S8, a travel distance is calculated using only the plane area Π_(f) of the VPP image I_(V)(t), so that the own vehicle velocity vector V_(V) can be determined accurately even in an environment where moving and still objects exist together.

It is known in the art that if an object at a certain height (distance) such as a road surface or the like is imaged and a velocity is measured with respect to the road surface, then when an object having a height with respect to the road surface is imaged and a velocity is measured with respect to the object, a velocity detection error occurs based on the height. According to the processing of steps S7, S8, since only the plane area Π_(f) is used and calculations are made excluding the object with the height, no height-induced error is caused.

According to the processing of steps S7, S8, since the distance to the plane is also detected, even if a plane having a height with respect to a road surface such as a footway occupies a substantial portion of the image, for example, a velocity can be calculated in view of the height.

The plane area Π_(f) determined in the present embodiment is an area corresponding to the substantially flat road plane Π on which the vehicle 10 travels, and is exclusive of vertical surfaces and other surfaces at different levels though they are planar.

In the above description, the base camera 12 and the reference camera 14 are provided. However, more cameras may be provided if necessary. 

1. A plane detecting apparatus for detecting a plane from a captured image with capturing units, comprising: a pair of image capturing units located in a predetermined positional relationship, for capturing images of a mutually overlapping area containing a plane; a parameter storing unit for storing, as parameters, a rotation matrix and a translation vector for transforming one of coordinate systems of said pair of said image capturing units into another coordinate system; and a projection transformation matrix calculating unit for calculating a projection transformation matrix, said projection transformation matrix transforming one of said images captured by one image capturing unit to overlap said plane contained in said one image onto a plane contained in another of said images captured by another image capturing unit, by use of said rotation matrix and said translation vector; wherein said plane is detected using said projection transformation matrix.
 2. A plane detecting apparatus according to claim 1, further comprising a plane parameter calculating unit for calculating plane parameters comprising a normal vector of said plane and a distance from one of said image capturing units as a base to said plane, and wherein said projection transformation matrix calculating unit calculates said projection transformation matrix by use of said rotation matrix, said translation vector, said normal vector and said distance.
 3. A plane detecting apparatus according to claim 1, wherein said image capturing units are fixed to a mobile object.
 4. A plane detecting apparatus according to claim 1, further comprising a plane area extracting unit for extracting a plane area based on a differential image between a projectively transformed image obtained by transforming the one image captured by the one image capturing unit with said projection transformation matrix and the other image captured by the other image capturing unit.
 5. A plane detecting apparatus for detecting a plane from a captured image with image capturing units, comprising: a pair of image capturing units located in a predetermined positional relationship, for capturing images of a mutually overlapping area containing a plane; a parameter storing unit for storing, as parameters, a rotation matrix and a translation vector for transforming one of coordinate systems of said pair of said image capturing units into another coordinate system, internal parameters of said pair of said image capturing units, an initial value of a normal vector of said plane and an initial value of a distance from one image capturing unit of said image capturing units, as a base, to said plane; and a projection transformation matrix estimating unit for changing said initial value of said normal vector and said initial value of said distance based on a density gradient method by use of said rotation matrix, said translation vector and said internal parameters to estimate a projection transformation matrix for overlapping planes contained in a stereo image captured by said pair of said image capturing units, onto each other, wherein said plane is detected using said projection transformation matrix.
 6. A plane detecting apparatus according to claim 5, further comprising a plane parameter estimating unit for estimating plane parameters comprising said normal vector of said plane and said distance from one of said image capturing units as a base to said plane, and wherein said plane parameter estimating unit estimates said plane parameters by use of amounts of changes of said normal vector and said distance changed when said projection transformation matrix has been estimated by said projection transformation matrix estimating unit, with respect to said initial values of said normal vector and said distance stored in said parameter storing unit.
 7. A plane detecting apparatus according to claim 5, wherein said initial values of said normal vector and said distance are initial values in a state where a mobile object with said pair of said image capturing units fixed thereto is held at rest.
 8. A plane detecting apparatus according to claim 5, further comprising a spatial position calculating unit for calculating a spatial position of said plane, using said plane parameters estimated by said plane parameter estimating unit.
 9. A plane detecting method for detecting a plane from a captured image with image capturing units, comprising: a first step of capturing images of a mutually overlapping area containing a plane by use of a pair of image capturing units located in a predetermined positional relationship; and a second step of calculating a projection transformation matrix for transforming one of said images captured by one image capturing unit of said pair of said image capturing units to overlap said plane contained in the one image onto a plane contained in another image captured by another image capturing unit, by use of a rotation matrix and translation vector for transforming one coordinate system of one image capturing unit into another coordinate system of another image capturing unit, wherein said plane is detected using said projection transformation matrix.
 10. A plane detecting method according to claim 9, wherein, using said rotation matrix, said translation vector, said internal parameters of said pair of said image capturing units, a normal vector of said plane and a distance from the one image capturing unit as a base to said plane, said projection transformation matrix is defined as $H = {{A_{r} \cdot {k\left( {R + \frac{{tn}^{t}}{d}} \right)}}A_{b}^{- 1}}$ where H is said projection transformation matrix; A_(b), A_(r) are said internal parameters of said pair of said image capturing units; R is said rotation matrix; t is said translation vector; n is said normal vector of said plane; d is said distance from the one image capturing unit as a base to said plane; and k is a coefficient which is not 0; and wherein said normal vector n and said distance d are changed to calculate said projection transformation matrix H such that said images captured by said pair of said image capturing units maximally overlap each other. 